View the step-by-step solution to:

The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2. Max 2x1 + x2 s.

The optimal solution of the linear programming problem is at the intersection of constraints 1 and 2.
                                Max        2x1 +   x2
                                s.t.           4x1 + 1x2                                                  4x1 + 3x2                                                  1x1 + 2x2  £  300
                                                     x1 , x2  >  0
Compute the dual prices for the three constraints.
         .45, .25, 0
        .25, .25, 0
        0, .25, .45
        .45, .25, .25

Recently Asked Questions

Why Join Course Hero?

Course Hero has all the homework and study help you need to succeed! We’ve got course-specific notes, study guides, and practice tests along with expert tutors.

-

Educational Resources
  • -

    Study Documents

    Find the best study resources around, tagged to your specific courses. Share your own to gain free Course Hero access.

    Browse Documents
  • -

    Question & Answers

    Get one-on-one homework help from our expert tutors—available online 24/7. Ask your own questions or browse existing Q&A threads. Satisfaction guaranteed!

    Ask a Question