Sign Up

Have an account? Sign In Now

Sign In

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

Sorry, you do not have permission to ask a question, You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here
Sign InSign Up

SIKSHAPATH

SIKSHAPATH Logo SIKSHAPATH Logo

SIKSHAPATH Navigation

  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Search
Ask A Question

Mobile menu

Close
Ask A Question
  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
  • About
  • SIKSHAPATH Latest Questions

    Ajit
    • 0
    Ajit
    Asked: May 19, 2022In: Software Engineering

    Design a structure chart for generation of bill of a …

    • 0

    Design a structure chart for generation of bill of a patient in hospital

    • 0 Answers
    • 97 Views
    Answer
    Ajit
    • 0
    Ajit
    Asked: December 4, 2021In: Programming Language

    Write a program that takes as input the size of the array and the elements in the array. The program …

    • 0

    Write a program that takes as input the size of the array and the elements in the array. The program then asks the user to enter a particular index and prints the element at that index. This program may generate Array ...

    • 1 Answer
    • 752 Views
    Answer
    Ajit
    • 0
    Ajit
    Asked: November 25, 2021In: Mathematics

      Refer the pic ………..

    • 0

      Refer the pic ………..

    • 1 Answer
    • 122 Views
    Answer
    Ajit
    • 2
    Ajit
    Asked: November 25, 2021In: Mathematics

    Solve the NLPP by Lagrange’s multiplier Max Z=4X1-x12+8×2-x22 subject to x1+x2=2, x1,x2>=0

    • 2

    Solve the NLPP by Lagrange’s multiplier Max Z=4X1-x12+8x2-x22 subject to x1+x2=2, x1,x2>=0

    solve the nlpp by lagrange's multiplier max z=4x1-x12+8x2-x22 subject to x1+x2=2x1x2>=0
    • 1 Answer
    • 1k Views
    Answer
    Ajit
    • 0
    Ajit
    Asked: November 25, 2021In: Mathematics

    Solve the following problem using DPP Maximize                          Z = 10×1+30×2 Subject to constraints:       3×1+6×2 ≤ 168, 12 x2≤240 x1, x2≥ 0

    • 0

    Solve the following problem using DPP Maximize                          Z = 10x1+30x2 Subject to constraints:       3x1+6x2 ≤ 168, 12 x2≤240 x1, x2≥ 0

    • 1 Answer
    • 212 Views
    Answer
    Ajit
    • 0
    Ajit
    Asked: November 25, 2021In: Mathematics

    Solve the following problem using DPP Maximize                          Z = x1+9×2 Subject to constraints:       2×1+x2 ≤ 25, x2≤11 x1, x2≥ 0

    • 0

    Solve the following problem using DPP Maximize                          Z = x1+9x2 Subject to constraints:       2x1+x2 ≤ 25, x2≤11 x1, x2≥ 0

    • 1 Answer
    • 136 Views
    Answer
    1 2

    Sidebar

    store ads

    Stats

    • Questions 1k
    • Answers 1k
    • Posts 149
    • Best Answers 89
    • This Free AI Tool Translates Entire Books in Minute !
    • AI News: 🎬 Hollywood’s AI Studios, 🎓 OpenAI’s Latest Gift to Educators, 🚚 Class8 Bags $22M, 🧠 Google Gemini’s Memory Upgrade
    • AI NEWS: Legal Action Against OpenAI, $16M Paid, & Elon Musk’s Praise from Investor 🤖💰📑 | AI Boosts Cloud Seeding for Water Security 🌱💧
    • AI News: 🎬AI Video Tool Scam Exposed🤯, 🛰️ AI-Powered Drones to Ukraine 😱, Google’s $20M AI Push, Sam Altman Joins SF’s Leadership Team
    • AI News: 🤝 Biden Meets Xi on AI Talks, 💡 Xavier Niel’s Advice for Europe, ♻️ Hong Kong’s Smart Bin Revolution, 🚀 AI x Huawei

    Explore

    • Recent Questions
    • Questions For You
    • Answers With Time
    • Most Visited
    • New Questions
    • Recent Questions With Time

    Footer

    SIKSHAPATH

    Helpful Links

    • Contact
    • Disclaimer
    • Privacy Policy Notice
    • TERMS OF USE
    • FAQs
    • Refund/Cancellation Policy
    • Delivery Policy for Sikshapath

    Follow Us

    © 2021-24 Sikshapath. All Rights Reserved