Question
In: Math
Use the graphical method for linear programming to find the optimal solution for the following problem....
Use the graphical method for linear programming to find the optimal solution for the following problem.
Maximize P = 4x + 5 y
subject to 2x + 4y ≤ 12
5x + 2y ≤ 10
and x ≥ 0, y ≥ 0.
graph the feasible region
Solutions
milcah answered 1 year agoRelated Solutions
For the following linear programming problem, determine the optimal solution by the graphical solution method Max...
For the following linear programming problem, determine the optimal
solution by the graphical solution method
Max
-x + 2y
s.t.
6x - 2y <= 3
-2x + 3y <= 6
x + y <= 3
x, y
>= 0
Use the branch and bound method to find the optimal solution to the following integer programming...
Use the branch and bound method to find the optimal solution to
the following integer programming problem: maximize 7x1 + 3x2
subject to: 2 x1 + x2 < 9 3 x1 + 2x2 <13 x1, x2 > 0; x1,
x2 integer
Instead of using EXCEL Solver to solve this problem directly as an
integer programming problem, use EXCEL Solver to solve the LP
problems at each branch, with the appropriate constraints added,
according to the branch and bound algorithm. Be...
For the following LP problem, determine the optimal solution by the graphical solution method. Min Z=...
For the following LP problem, determine the optimal solution by
the graphical solution method.
Min Z= 3x1+2x2
Subject to 2x1+x2 >10
-3x1+2x2
< 6
X1+x2
> 6
X1,x1
> 0
Graph and shade the feasible region
Solve the following linear programming problem by the graphical method. Maximize Z = 400 X1 +...
Solve the following linear programming problem by the
graphical method.
Maximize Z = 400 X1 + 200 x 2
Subject to : X1 + 8X2 <= 24
X1 + 2X2 <= 12
X1 >= 0 , X2 >= 0
You will need to graph each of the constraints to answer
the following questions. You can draw a rough graph.
a) State the coordinates of the point where the
constraints interact.
b) Define in words the region of feasible
solutions.
c)...
The optimal solution of the linear programming problem is at the intersection of constraints 1 and...
The optimal solution of the linear programming problem is at the
intersection of constraints 1 and 2. Please answer the following
questions by using graphical sensitivity analysis.
Max s.t.
Max 2x1 + x2
s.t. 4x1 +1x2 ≤8
4x1 +3x2 ≤12
1x1 +2x2 ≤6
x1 , x2 ≥ 0
Over what range can the coefficient of x1 vary before the
current solution is no longer optimal?
Over what range can the coefficient of x2 vary before the
current solution is no...
Solve the given linear programming problem using the simplex method. If no optimal solution exists, indicate...
Solve the given linear programming problem using the simplex
method. If no optimal solution exists, indicate whether the
feasible region is empty or the objective function is unbounded.
(Enter EMPTY if the feasible region is empty and UNBOUNDED if the
objective function is unbounded.)
Minimize
c = x + y + z +
w
subject to
x
+
y
≥
80
x
+
z
≥
60
x
+
y
−
w
≤
50
y
+
z
−
w
≤
50...
Find the complete optimal solution to this linear programming problem. Min 5x + 6y s.t. 3x...
Find the complete optimal solution to this linear programming
problem.
Min
5x + 6y
s.t.
3x + y >= 15
x + 2y >= 12
3x + 2y >= 24
x , y >= 0
PLEASE NOTE I AM USING EXCEL FOR THIS QUESTION PLEASE SHOW ALL
WORK AND FORMULAS
Find the complete optimal solution to this linear programming problem. Max 5x + 3y s.t. 2x...
Find the complete optimal solution to this linear programming
problem.
Max
5x + 3y
s.t.
2x + 3y <=30
2x + 5y <= 40
6x - 5y <= 0
x , y >= 0
I AM USING EXCEL FOR THIS QUESTION PLEASE SHOW ALL WORK AND
FORMULAS, THANK YOU
Find the complete optimal solution to this linear programming problem. Min 5x + 6y s.t. 3x...
Find the complete optimal solution to this linear programming
problem.
Min
5x + 6y
s.t.
3x + y >= 15
x + 2y >= 12
3x + 2y >= 24
x , y >= 0
Find the complete optimal solution to this linear programming
problem.
Min
5x + 6y
s.t.
3x + y >= 15
x + 2y >= 12
3x + 2y >= 24
x , y >= 0
Solve this linear programming (LP) problem using the transportation method. Find the optimal transportation plan and...
Solve this linear programming (LP) problem using the
transportation method. Find the optimal transportation plan and the
minimum cost. (Leave no cells blank - be certain to enter
"0" wherever required. Omit the "$" sign in your
response.)
Minimize
8x11
+
2x12 + 5x13 +
2x21 + x22
+ 3x23 +
7x31 + 2x32 +
6x33
Subject to
x11 + x12 +
x13
=
90
x21 + x22 +
x23
=
105
x31 + x32 +
x33
=
105
x11...
ADVERTISEMENT
ADVERTISEMENT
Latest Questions
- Current Market Mix of Netflix, as detail as possible, please.
- This is all one question, thank you so much in advance! You must evaluate a proposal...
- X Company is considering the purchase of a new processor that costs $200,000. Shipping and setup...
- There are a large number of tasks involved in information technology and programming, and many of...
- Using one quantitative and one qualitative health policy research method described in this chapter, design a...
- What is the Rawls' solution to the age-old question of social (economic / distributive) justice?...
- St. Johns River Shipyards' welding machine is 15 years old, fully depreciated, and has no salvage...
ADVERTISEMENT