Spread the word.

Share the link on social media.

Share
  • Facebook
Have an account? Sign In Now

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
Sign InSign Up

SIKSHAPATH

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
Home/ Questions/Q 8081
Next
In Process

SIKSHAPATH Latest Questions

Minni
  • 0
  • 0
Minni
Asked: November 23, 20212021-11-23T18:15:40+05:30 2021-11-23T18:15:40+05:30In: Mathematics

Solve the following problem using DPP Maximize Z = 2×1+5×2 Subject to constraints: 2×1+x2 ≤430 2×2 ≤ 460, x1, x2≥ 0

  • 0
  • 0

Solve the following problem using DPP Maximize Z = 2x1+5x2 Subject to constraints: 2x1+x2 ≤430 2x2 ≤ 460, x1, x2≥ 0

dppmathnumerical and optimization techniquesuse dynamic programming to solve the following lpp max z=2x1+5x2
  • 3 3 Answers
  • 2k Views
  • 0 Followers
  • 0
Answer
Share
  • Facebook

    3 Answers

    • Voted
    • Oldest
    • Recent
    1. Minni
      Minni
      2021-11-24T00:20:05+05:30Added an answer on November 24, 2021 at 12:20 am

      Here’s the Solution of DPP

       

        • 4
      • Reply
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn
      • vishal2892
        vishal2892
        2021-12-15T13:12:30+05:30Replied to answer on December 15, 2021 at 1:12 pm

        thnaks!!

          • 1
        • Reply
        • Share
          Share
          • Share on WhatsApp
          • Share on Facebook
          • Share on Twitter
          • Share on LinkedIn
    2. Okmnj
      Okmnj
      2024-04-30T11:16:28+05:30Added an answer on April 30, 2024 at 11:16 am

      Maximize Z = 2×1+5×2 Subject to constraints: 2×1+x2 ≤430 2×2 ≤ 460, x1, x2≥ 0

       

        • 0
      • Reply
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn

    Leave an answer
    Cancel reply

    You must login to add an answer.

    Forgot Password?

    Need An Account, Sign Up Here

    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

    Insert/edit link

    Enter the destination URL

    Or link to existing content

      No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.