Question

In: Operations Management

Consider the following all-integer linear program: Max 5x1+8x2 s.t. 6x1+5x2≤30 9x1+4x2≤36 1x1+2x2≤10 x1, x2 ≥ 0...

Consider the following all-integer linear program: Max 5x1+8x2

s.t.

6x1+5x2≤30

9x1+4x2≤36

1x1+2x2≤10

x1, x2 ≥ 0 and integer

For part 1 just do a regular linear program in Excel. This is a max problem.

For part 2 do a integer program in Excel.

Solutions

Expert Solution

Part 1:

Form LP in the excel as below:

Use Formula SUMPRODUCT() for constrains as well as objective function

Solver Parameters:

Add Objective Cell, Decision Variables, and Constrains. Do not add constrains for integers in this part.

Optimal Solution:

After Round down will be

X1 = 1,

X2 = 4

Max. Profit = 1*5 + 8*4 = 37

Part 2.

We only need to make one change. We need to add integer constrain for X1, X2

Solution:

After adding integer solution, solution we get is different than the optimal solution we get in the earlier part.

Optimal Integer Solution:

X1 = 0, X2 =5

Max. Profit = 5*8 =40


Related Solutions

Consider the following all-integer linear program: Max 5x1 +8x2 s.t.   6x1 + 5x2 <= 30 9x1...
Consider the following all-integer linear program: Max 5x1 +8x2 s.t.   6x1 + 5x2 <= 30 9x1 + 4x2 <= 36 1x1 + 2x2 <=10 x1, x2 $ 0 and integer a. Graph the constraints for this problem. Use dots to indicate all feasible integer solutions. b. Find the optimal solution to the LP Relaxation. Round down to find a feasible integer solution. c. Find the optimal integer solution. Is it the same as the solution obtained in part (b) by...
3. Consider the following all-integer linear program: Max 1x1+1x2 s.t. 4x1+6x2 ?22 1x1+5x2 ?15 2x1+1x2 ?9...
3. Consider the following all-integer linear program: Max 1x1+1x2 s.t. 4x1+6x2 ?22 1x1+5x2 ?15 2x1+1x2 ?9 x1, x2 ?0 and integer a. Graph the constraints for this problem. Use dots to indicate all feasible integer solutions. b. Solve the LP Relaxation of this problem. c. Find the optimal integer solution.
Consider the following all-integer linear program: Max x1 + x2 s.t. 4x1 + 6x2 ≤ 22...
Consider the following all-integer linear program: Max x1 + x2 s.t. 4x1 + 6x2 ≤ 22 x1 + 5x2 ≤ 15 2x1 + x2 ≤ 9   x1, x2 ≥ 0 and integer Solve the LP Relaxation of this problem. The optimal solution to the LP Relaxation is x1 = ___, x2 = .____________ Its value is ___________ Find the optimal integer solution. The optimal solution to the LP Relaxation is x1 = _____x2 = __________ Its value is _______
3. Consider the following linear program: MIN 6x1 + 9x2 ($ cost) s.t. x1 +2x2 ≤8...
3. Consider the following linear program: MIN 6x1 + 9x2 ($ cost) s.t. x1 +2x2 ≤8 10x1 + 7.5x2 ≥ 30 x2 ≥ 2 x1,x2 ≥0 The Management Scientist provided the following solution output: OPTIMAL SOLUTION Objective Function Value = 27.000 Variable Value Reduced Cost X1 1.500 0.000 X2 2.000 0.000 Constraint Slack/Surplus Dual Price 1 2.500 0.000 2 0.000 −0.600 3 0.000 −4.500 OBJECTIVE COEFFICIENT RANGES Variable Lower Limit Current Value Upper Limit X1 0.000 6.000 12.000 X2 4.500...
Consider the following linear program. Maximize z= 5x1+ 3x2 subject to 3x1+ 5x2≤15 5x1+ 2x2≤10 –...
Consider the following linear program. Maximize z= 5x1+ 3x2 subject to 3x1+ 5x2≤15 5x1+ 2x2≤10 – x1+ x2≤2 x2≤2.5 x1≥0, x2≥0 a. Show the equality form of the model. b. Sketch the graph of the feasible region and identify the extreme point solutions. From this representation find the optimal solution. c. Analytically determine all solutions that derive from the intersection of two constraints or nonnegativity restrictions. Identify whether or not these solutions are feasible, and indicate the corresponding objective function...
Consider the following linear program:   maximize z = x1 + 4x2 subject to: x1 + 2x2...
Consider the following linear program:   maximize z = x1 + 4x2 subject to: x1 + 2x2 <= 13 x1 - x2 <= 8 - x1 + x2 <= 2 -3 <= x1 <= 8 -5 <= x2 <= 4 Starting with x1 and x2 nonbasic at their lower bounds, perform ONE iteration of the Bounded Variables Revised Simplex Method. (Tableau or matrix form is acceptable). Show your work. Clearly identify the entering and leaving variables. After the pivot, identify the...
Consider the following linear programming problem. min −x1 + 4x2 subject to: • x1 + x2...
Consider the following linear programming problem. min −x1 + 4x2 subject to: • x1 + x2 ≥ 1 • 3x1 + x2 ≤ .5 • x1, x2 ≥ 0 Formulate the dual of this problem.
3) (15 pts) Consider the following LP formulation: max z = x1 + 2x2 s.t. −...
3) (15 pts) Consider the following LP formulation: max z = x1 + 2x2 s.t. − x1 + x2 ≤ 2 x2 ≤ 3 kx1 + x2 ≤ 2k + 3 x1, x2 ≥ 0 The value of the parameter k ≥ 0 has not been determined yet. The solution currently being used is x1 = 2, x2 = 3. Use graphical analysis to determine the values of k such that this solution is actually optimal.
Consider the following linear program:    MAX Z = 25A + 30B    s.t. 12A +...
Consider the following linear program:    MAX Z = 25A + 30B    s.t. 12A + 15B ≤ 300    8A + 7B ≤ 168 10A + 14B ≤ 280    Solve this linear program graphically and determine the optimal quantities of A, B, and the    value of Z. Show the optimal area.
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...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT