Problem is
MAX P(zx)=6x1+4x2
subject to:
x1+x2≥11
2x1+3x2≥30
x1+2x2≤22
and x1,x2≥0;
Hint to draw constraints
1. To draw constraint
x1+x2≥11→(1)
Treat it as x1+x2=11
When x1=0 then x2=?
⇒(0)+x2=11
⇒x2=11
When x2=0 then x1=?
⇒x1+(0)=11
⇒x1=11
x1 | 0 | 11 |
x2 | 11 | 0 |
2. To draw constraint
2x1+3x2≥30→(2)
Treat it as 2x1+3x2=30
When x1=0 then x2=?
⇒2(0)+3x2=30
⇒3x2=30
⇒x2=30/3=10
When x2=0 then x1=?
⇒2x1+3(0)=30
⇒2x1=30
⇒x1=30/2=15
x1 | 0 | 15 |
x2 | 10 | 0 |
3. To draw constraint
x1+2x2≤22→(3)
Treat it as x1+2x2=22
When x1=0 then x2=?
⇒(0)+2x2=22
⇒2x2=22
⇒x2=22/2=11
When x2=0 then x1=?
⇒x1+2(0)=22
⇒x1=22
x1 | 0 | 22 |
x2 | 11 | 0 |
The value of the objective function at each of these extreme points is as follows:
Extreme Point Lines through Extreme Point Objective function value
Coordinates z=6x1+4x2
Extreme Point | Lines through Extreme Point | Objective function value |
Coordinates | z=6x1+4x2 | |
(x1,x2) | ||
A(0,11) | 1→x1+x2≥11 | 6(0)+4(11)=44 |
3→x1+2x2≤22 | ||
B(22,0) | 3→x1+2x2≤22 | 6(22)+4(0)=132 |
5→x2≥0 | ||
C(15,0) | 2→2x1+3x2≥30 | 6(15)+4(0)=90 |
5→x2≥0 | ||
D(3,8) | 1→x1+x2≥11 | 6(3)+4(8)=50 |
2→2x1+3x2≥30 |
The graphical solution of the same is as follows:
The maximum value of the objective function z=132 occurs at the extreme point (22,0).
Hence, the optimal solution to the given LP problem is : x1=22,x2=0 and max z=132.
Hence P = 132,
X1 = 22,
X2 = 0
(1 point) Use the graphical method to maximize P = 6x1 + 4x2 subject to x1...
(1 point) Use the simplex method to maximize P = 2x1 + 3x2 + x3 subject to -X -X1 + X2 + 4x2 + 2x2 + 10x35 10 + 6x3 9 + 10x3 S 11 X X120 x220 x3 20 P=
e the simplex method to maximize P= 7x1 + 13x2 subject to 4x1 x1 + + x2 4x2 = = 8 12 x120 x2 > 0 P=
Excel
Use Simplex method and Exel To solve the following LPPs. Maximize Maximize P-3x + x2 subject to the constraints x1 + x2 = 2 2x) + 3x2 s 12 3x + = 12 x 20 x220 P = 5x1 + 7x2 subject to the constraints 2xy + 3x2 = 12 3x + x2 = 12 x 20 *2 2 0 Maximize Maximize P = 2x2 + 4x2 + x3 subject to the constraints -*1 + 2x2 + 3x3 5...
Min Z = 6X1 + 4x2 Subject to Xi + 2x2 > 2 -X1 + 2x2 5 4 3x1 + 2x2 < 12 X1, X2 > 0
(2 points) Use the simplex method to maximize P = 7xı + 13x2 subject to < 5x1 x1 + + x2 5x2 10 15 x120 x2 > 0 P =
Use the simplex method to solve the following maximum problem: Maximize P= x1 +2:02 Subject to the constraints: 2x1 + x2 < 8 21 +2y < 5 X1 > 0 22 > 0 and using your final tableau answer the questions below by entering the correct answer in each blank box. Please enter fractions as 3/5, -4/7, and so on. 21 2 P=
Solve the following using graphing techniques: a. Maximize 2x1 + 3x2 subject to the constraints, 2x1 + 2x2 < 8,X1 + 2x25 4, and X1 > 3, x2 > 0
4.6-1.* Consider the following problem. Maximize Z= 2x1 + 3x2, subject to x1 + 2x2 54 x1 + x2 = 3 and X120, X2 0. DI (a) Solve this problem graphically. (b) Using the Big M method, construct the complete first simplex tableau for the simplex method and identify the corresponding initial (artificial) BF solution. Also identify the initial entering basic variable and the leaving basic variable. I (c) Continue from part (b) to work through the simplex method step...
3. Consider the following LP. Maximize u = 4x1 + 2x2 subject to X1 + 2x2 < 12, 2x1 + x2 = 12, X1, X2 > 0. (a) Use simplex tableaux to find all maximal solutions. (b) Draw the feasible region and describe the set of all maximal solutions geometrically.
Problem #5 -- Consider the following linear programming problem: Maximize Z = 2x1 + 4x2 + 3x3 subject to: X1 + 3x2 + 2x3 S 30 best to X1 + x2 + x3 S 24 3x1 + 5x2 + 3x3 5 60 and X120, X220, X3 2 0. You are given the information that x > 0, X2 = 0, and x3 >O in the optimal solution. Using the given information and the theory of the simplex method, analyze the...