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 26, 2021In: Mathematics

      Write the Dual of LPP Min z= 3×1+ 2×2 Subject to x1 – x2≤ 1, x1+x2 ≥ 3, x1, x2≥ …

      I'M ADMIN
      I'M ADMIN
      Added an answer on November 26, 2021 at 7:48 pm

      FOLLOW THE LINK: https://sikshapath.in/question/min-z-3x1-2x2/

      FOLLOW THE LINK:

      Min z= 3×1+ 2×2

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

      Write the dual of following LPP Maximize Z= 3X1+4X2 Subject to 2×1+3×2<=16 5×1+2×2>=20 x1,x2>=0

      I'M ADMIN
      I'M ADMIN
      Added an answer on November 26, 2021 at 7:45 pm

      follow the link : https://sikshapath.in/question/dual/

      follow the link :

      https://sikshapath.in/question/dual/

      See less
        • 0
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn
    3. Asked: November 26, 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

      I'M ADMIN
      I'M ADMIN
      Added an answer on November 26, 2021 at 7:42 pm

      FOLLOW THIS LINK FOR ANSWER: https://sikshapath.in/question/solve-the-following-problem-using-dpp-maximize-4/

      FOLLOW THIS LINK FOR ANSWER:

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

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

      Create a binary search tree for the following elements (98, 2, 48, 12, 56, 32, 4, 67, 23, 87, 23, 55, 46)

      I'M ADMIN
      I'M ADMIN
      Added an answer on November 26, 2021 at 7:41 pm

      GO THROUGH THIS LINK FOR ANSWER: https://sikshapath.in/question/create-a-binary-search-tree-with-the-input-given-below-98-2-48-12-56-32-4-67-23-87-23-55-46-a-insert-21-39-45-54-and-63-into-the-tree-b-delete-values-23-56-2-and-45-from-the-tr/

      GO THROUGH THIS LINK FOR ANSWER:

      https://sikshapath.in/question/create-a-binary-search-tree-with-the-input-given-below-98-2-48-12-56-32-4-67-23-87-23-55-46-a-insert-21-39-45-54-and-63-into-the-tree-b-delete-values-23-56-2-and-45-from-the-tr/

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

      Write a query to create a view that shows for each order the salesman and customer by name. 

      I'M ADMIN
      I'M ADMIN
      Added an answer on November 26, 2021 at 12:10 am

      FOLLOW THIS LINK: https://sikshapath.in/question/write-a-query-to-create-a-view-that-shows-for-each-order-the-salesman-and-customer-by-name/

      FOLLOW THIS LINK:

      Write a query to create a view that shows for each order the salesman and customer by name.

      See less
        • 0
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn
    6. 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

      I'M ADMIN
      I'M ADMIN
      Added an answer on November 25, 2021 at 10:27 pm

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

      Solve the following problem using DPP

      Maximize                          Z = x1+9x2

      Subject to constraints:       2x1+x2 ≤ 25,

      x2≤11

      x1, x2≥ 0

       

      ANSWER:

      See less
      Attachment

        • 0
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn
    1 … 102 103 104 105 106 … 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