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
    1. 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

      I'M ADMIN
      I'M ADMIN
      Added an answer on November 25, 2021 at 1:52 pm

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

      Solve the following problem using DPP

      Maximize                          Z = 10x1+30x2

      Subject to constraints:       3x1+6x2 ≤ 168,

      12 x2≤240

      x1, x2≥ 0

       

      ANSWER:

      See less
      Attachment

        • 0
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn
    2. Asked: November 25, 2021In: Mathematics

      Solve the following problem using DPP Maximize                          Z = 50×1+100×2 Subject to constraints:       10×1+5×2 ≤ 2500, 4×1+10×2 ≤2000, x1, x2≥ 0

      I'M ADMIN
      I'M ADMIN
      Added an answer on November 25, 2021 at 1:28 pm

      Solve the following problem using DPP Maximize                          Z = 50x1+100x2 Subject to constraints:       10x1+5x2 ≤ 2500, 4x1+10x2 ≤2000,   ANSWER:

      Solve the following problem using DPP

      Maximize                          Z = 50x1+100x2

      Subject to constraints:       10x1+5x2 ≤ 2500,

      4x1+10x2 ≤2000,

       

      ANSWER:

      See less
      Attachment

        • 0
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn
    3. Asked: November 24, 2021In: Data Structure

      Write a C/C++ program to implement Binary Search Tree.

      I'M ADMIN
      I'M ADMIN
      Added an answer on November 24, 2021 at 9:33 pm

      IF THE SAME QUESTION ALREADY EXISTS ON-SITE THEN PASTE THE REDIRECTION LINK HERE (USE SEARCH BOX TO FIND IF THE QUESTION EXISTS OR NOT) INSTEAD OF ATTACHMENT.  

      IF THE SAME QUESTION ALREADY EXISTS ON-SITE THEN PASTE THE REDIRECTION LINK HERE (USE SEARCH BOX TO FIND IF THE QUESTION EXISTS OR NOT) INSTEAD OF ATTACHMENT.

       

      See less
        • 0
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn
    4. Asked: November 24, 2021In: Data Structure

      Write a C/C++ program to implement Binary Search Tree.

      I'M ADMIN
      I'M ADMIN
      Added an answer on November 24, 2021 at 9:30 pm

      https://sikshapath.in/question/write-a-program-to-implement-binary-search-tree/

      Write a program to implement Binary Search Tree.

      See less
        • 0
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn
    5. Asked: November 23, 2021In: Mathematics

      Determine the optimal solution of the following NLPP by Lagrange multiplier method Optimize Z=x12-10×1+x22 -6×2+x32-4×3 , subject to x1+x2+x3=7 ,x1,x2,x3>=0

      I'M ADMIN
      I'M ADMIN
      Added an answer on November 24, 2021 at 8:11 pm
      This answer was edited.

      Optimize Z=x12-10x1+x22 -6x2+x32-4x3 , subject to x1+x2+x3=7 ,x1,x2,x3>=0

      Optimize Z=x12-10x1+x22 -6x2+x32-4x3 , subject to x1+x2+x3=7 ,x1,x2,x3>=0

      See less
      Attachment

        • 2
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn
    6. Asked: November 23, 2021In: Mathematics

      Solve the NLPP by Lagrange’s Multiplier Method Max Z=4×1-x12+8×2-x22 ,Subject to x1+x2=2, x1,x2>=0

      I'M ADMIN
      I'M ADMIN
      Added an answer on November 24, 2021 at 8:10 pm

      https://sikshapath.in/question/solve-the-nlpp-by-lagranges-multiplier/

      Solve the NLPP by Lagrange’s multiplier  

      See less
        • -2
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn
    1 … 104 105 106 107 108 … 122

    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