Consider the following integer linear programming problem: Max Z = 4.2x + 4.8y + 5.6z Subject...

Consider the following integer linear programming problem:

Max Z = 4.2x + 4.8y + 5.6z

Subject to: 4x + 2y + 7z ≤ 37

4x + 4y + 5z ≤ 40

2.8y ≤ 10

x, y, z ≥ 0 and integer

What is the optimal solution to the integer linear programming problem?

State the optimal values of decision variables.

Solutions

Expert Solution

Max Z = 4.2x + 4.8y + 5.6z

Subject to: 4x + 2y + 7z ? 37

4x + 4y + 5z ? 40

2.8y ? 10

x, y, z ? 0 and integer

The solution to the LP relaxation is: x = 3.839, y = 3.571, z = 2.071.

------------------------------------

DEAR STUDENT,

IF YOU HAVE ANY QUERY ASK ME IN THE COMMENT BOX,I AM HERE TO HELPS YOU.PLEASE GIVE ME POSITIVE RATINGS

*****************THANK YOU***************

orchestra answered 1 year ago

Next > < Previous

Related Solutions

Consider the following linear programming problem: Max Z = 3x1 + 3x2 Subject to: ...

Consider the following linear programming problem: Max Z = 3x1 + 3x2 Subject to: 10x1 + 4x2 ≤ 60 25x1 + 50x2 ≤ 200 x1, x2 ≥ 0 Find the optimal profit and the values of x1 and x2 at the optimal solution.

Consider the following Integer Linear Programming (ILP) model Maximize Z = X1 + 4X2 Subject to...

Consider the following Integer Linear Programming (ILP) model Maximize Z = X1 + 4X2 Subject to X1 + X2 < 7 // Resource 1 –X1 + 3X2 < 3 // Resource 2 X1, X2 > 0 X1, X2 are integer i. Consider using the Branch and Bound (B & B) technique to solve the ILP model. With the help of Tora software, draw the B & B tree. Always give priority for X1 in branching over X2. Clearly label the...

Simplex Method Consider the following linear programming problem: max z = 6x1 + 3x2 - 9x2...

Simplex Method Consider the following linear programming problem: max z = 6x1 + 3x2 - 9x2 - 9x3 + 15x4 s.t. 2x1 + 4x2 +6x3 + 8x4 <= 80 6x1 - 3x2 +3x3 + 6x4 <= 24 12x1 - 6x2 + 3x3 - 3x4 <= 30 x1, x2, x3, x4 >= 0 Rewrite the problem in standard form, that is, add the necessary slack variables in order to consider only equality constraints (and non-negativity). What is the...

Solve the following linear programming model graphically: Max Z= 3x1 +4x2 Subject to: 2x1 + 4x2...

Solve the following linear programming model graphically: Max Z= 3x1 +4x2 Subject to: 2x1 + 4x2 <= 22 -x1 + 4x2 <= 10 4x1 – 2x2 <= 14 x1 – 3x2 <= 1 x1, x2, >=0 Clearly identify the feasible region, YOUR iso-profit line and the optimal solution (that is, d.v. values and O.F. Value.

Consider the following linear programming problem: Maximize 16X + 14Y Subject to: 3X + 4Y ≤...

Consider the following linear programming problem: Maximize 16X + 14Y Subject to: 3X + 4Y ≤ 520 3X + 2Y ≤ 320 all variable ≥ 0 The maximum possible value for the objective function is

Consider the following linear programming problem Maximize 6x1 + 4x2 + 5x3 Subject to: 2x1 +...

Consider the following linear programming problem Maximize 6x1 + 4x2 + 5x3 Subject to: 2x1 + 3x2 + x3 ≥ 30 2x1 + x2 + x3 ≤ 50 4x1 + 2x2 + 3x3 ≤ 120 x1, x2, x3 ≥ 0 a) Find the optimal solution by using simplex method b) Find the dual price for the first constraint. c) Find the dual price for the second constraint. d) Find the dual price for the third constraint. e) Suppose the right-hand...

Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤...

Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤ 40 hr Constraint A 3X1 + 3X2 ≤ 30 hr Constraint B X1, X2 ≥ 0 Constraint C if A and B are the two binding constraints. (Round to ONLY two digits after decimal points) a) What is the range of optimality of the objective function? Answer ≤ C1/C2 ≤ Answer b) Suppose that the unit revenues for X1 and X2 are changed to $100 and...

Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤...

Consider the following linear programming problem Maximize $4X1 + $5X2 Subject To 2X1 + 5X2 ≤ 40 hr Constraint A 3X1 + 3X2 ≤ 30 hr Constraint B X1, X2 ≥ 0 Constraint C if A and B are the two binding constraints. (Round to ONLY two digits after decimal points) a) What is the range of optimality of the objective function? .......... ≤ C1/C2 ≤ ............ b) Suppose that the unit revenues for X1 and X2 are changed to $100 and...

For the following linear programming problem: Maximize z = 2x1+ x2 Such that ...

For the following linear programming problem: Maximize z = 2x1+ x2 Such that x1+ 2x2 ≤ 12 x2 ≥ 3 x1,x2 ≥ 0 (a) Write the first two constraints in equation form by adding slack or subtracting excess (surplus) variables. (b)Find all basic solutions for this LP (c) Which of these solutions are feasible? (d)Which of these feasible solutions is optimal? Find the optimal value of z

Consider the following linear programming problem: Z=$15X+$20Y Subject to: 8X+5Y<=40 0.4X+Y>=4 Solve the values of x...

Consider the following linear programming problem: Z=$15X+$20Y Subject to: 8X+5Y<=40 0.4X+Y>=4 Solve the values of x and y that will maximize revenue by using the corner point method graphical approach to linear programming. What revenue will result? Please show work.

Subjects