A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 5 years ago
Consider the following linear program:
Max z=3x1 +2x2 s.t.
2x1 + 2x2 ≤ 8
3x1 + 2x2 ≤ 12
1x1 + 0.5x2 ≤ 3
x1 , x2 ≥ 0
Find the optimal solution using the graphical solution procedure. What is the value of the objective function?
b) Does this linear program have a redundant constraint? If so, what is it? Does the solution change if the redundant constrain is removed from the model? Explain.
anonymous
 5 years ago
Consider the following linear program: Max z=3x1 +2x2 s.t. 2x1 + 2x2 ≤ 8 3x1 + 2x2 ≤ 12 1x1 + 0.5x2 ≤ 3 x1 , x2 ≥ 0 Find the optimal solution using the graphical solution procedure. What is the value of the objective function? b) Does this linear program have a redundant constraint? If so, what is it? Does the solution change if the redundant constrain is removed from the model? Explain.

This Question is Closed

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0This is hard for us because we can't graph it. How much do you know about linear programming?
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.