Finite Math MIXED CONSTRANTS 3. Minimize z = 18x3 + 24x2, subject to 3x, +4x, 2...

Question

Question

Finite Math

MIXED CONSTRANTS

math algebra

Answer 1

Answer #1

15 (3,12) (6,10) (9,4) the corner points of the constrained region is shown above

The value of objective function 18x1 + 24x2 is minimum at (x1, x2) =(9, 4)

The minimum value is 18(9)+24(4) =258

Answer 2

Similar Homework Help Questions

3. Consider the following LP model: Maximize z 3x 2x2 5x subject to =30 -60 +x6 = 20 + 2x3 3.x i ...

3. Consider the following LP model: Maximize z 3x 2x2 5x subject to =30 -60 +x6 = 20 + 2x3 3.x i + 4x2 Check the optimality and feasibility of the following basic solutions: Basic variables = (X1,X3.Xp). Inverse = | 0 0 0 0 1 3. Consider the following LP model: Maximize z 3x 2x2 5x subject to =30 -60 +x6 = 20 + 2x3 3.x i + 4x2 Check the optimality and feasibility of the following basic solutions:...
3. Consider the following LP model: Maximize z 3x 2x2 5x subject to =30 -60 +x6 = 20 + 2x3 3.x i ...

3. Consider the following LP model: Maximize z 3x 2x2 5x subject to =30 -60 +x6 = 20 + 2x3 3.x i + 4x2 Check the optimality and feasibility of the following basic solutions: Basic variables = (X1,X3.Xp). Inverse = | 0 0 0 0 1 3. Consider the following LP model: Maximize z 3x 2x2 5x subject to =30 -60 +x6 = 20 + 2x3 3.x i + 4x2 Check the optimality and feasibility of the following basic solutions:...
Use duality to solve problem 4 4. Minimize z-8x1 + 4x2 + 16x3 subject to 2x1 + 2x2 + 3x3 216 3x1 ...

Use duality to solve problem 4 4. Minimize z-8x1 + 4x2 + 16x3 subject to 2x1 + 2x2 + 3x3 216 3x1 +x2 t 4xs 2 14 3x +x2 + 5x3 2 12 xi,x2, x320 Use duality to solve problem 4 4. Minimize z-8x1 + 4x2 + 16x3 subject to 2x1 + 2x2 + 3x3 216 3x1 +x2 t 4xs 2 14 3x +x2 + 5x3 2 12 xi,x2, x320

8. Minimize z - 8x1 + 6x2 + 11x3 subject to 5x1 x2 + 3x3 s 4 5x1 + x2 + 3x3 2 2 2x, + 4x2 + 7x3 s...

8. Minimize z - 8x1 + 6x2 + 11x3 subject to 5x1 x2 + 3x3 s 4 5x1 + x2 + 3x3 2 2 2x, + 4x2 + 7x3 s.5 2x1 + 4x2 + 7x3 2 3 X1 + X2 + X3 = 1 (a) State the dual problem. (b) Solve both the primal and the dual problem with any method that works. (c) Check that your optimal solutions are correct by verifying they are feasible and the primal and...
1) Consider the following model: Minimize Z - 40x, +50x, subject to: 2x, + 3x, 2...

1) Consider the following model: Minimize Z - 40x, +50x, subject to: 2x, + 3x, 2 30 x,x2 212 2x, x2 20 x 20 a) Use the graphical method to solve this model b) How does the optimal solution change if the objective function is changed toi Z- 40x, 70x2 c) How does the optimal solution change if the third functional constraint is changed tot 2x, +x, 2 15
Excel Use Simplex method and Exel To solve the following LPPs. Maximize Maximize P-3x + x2...

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...

PROBLEMS 7.3 1. Minimize Z= 6x + 14y subject to 14x + 7y > 43 3x...

PROBLEMS 7.3 1. Minimize Z= 6x + 14y subject to 14x + 7y > 43 3x + 7y > 21 --x+y> -5 x,y > 0 2. Maximize Z= 2x + 2y subject to 2x - y > -4 x - 2y < 4 x+y = 6 Xy0
Maximize z = 3x, + 2x, subject to 6.x, +4x2 = 24 Solve the linear programming...

Maximize z = 3x, + 2x, subject to 6.x, +4x2 = 24 Solve the linear programming with Simplex Method. 10x, +3x, s 30 x,x220
Table 5.5 max z = 11x1 + 4x2 + x3 + 15x4 subject to 3z1 2 + 2z3 44 8x1 + 2x2-x3 + 7x4 20 1 2 4 1 ...

Table 5.5 max z = 11x1 + 4x2 + x3 + 15x4 subject to 3z1 2 + 2z3 44 8x1 + 2x2-x3 + 7x4 20 1 2 4 1 0 28 8 2 -1 70 1 50 -1 -15 0 0 0 1 2 -16 2 11 1 -18 0 7 4 4 0 2 0 2 1 106 T5 3 1 28 50- K 28-11 -4 42 0 1) Using Table 5.5, find the optimal value of the objective...

following problems, we will be performing sensitivity analysis on the following LPP: Maximize Z = 25x+30x,...

following problems, we will be performing sensitivity analysis on the following LPP: Maximize Z = 25x+30x, + 40x; subject to X; + 2xy + x2 < 40 8x, + X2 – 2x, 510 X-2x, +4x2 < 25 X,X23*, 20 and The final simplex tableau for this problem is given below. Basic Variable (0) (1) Z 1 0 X 0 3 /10 17/2 0 1 2150 Coefficient of: X2 X3 s 0 0 20 1 0 2/5 0 0 0 1...