Question

Problem 11-1 (a) Indicate whether the following linear program is an all-integer linear program or a...

Problem 11-1

(a) Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program.
Max 30x1 + 25x2
s.t.
3x1 + 1.5x2 ≤ 400
1.5x1 + 2x2 ≤ 250
1x1 + 1x2 ≤ 150
x1, x2 ≥ 0 and x2 integer
This is a mixed-integer linear program.
Write the LP Relaxation for the problem but do not attempt to solve.
If required, round your answers to one decimal place.
Its LP Relaxation is
Max x1 + x2
s.t.
x1 + 1.5x2 ≤  
1.5x1 + x2 >  
x1 + x2 ≤  
x1 , x2 ≤  0 and x1 integer
(b) Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program.
Max 3x1 + 4x2
s.t.
2x1 + 4x2 ≥ 8>
2x1 + 6x2 ≥ 12
x1, x2 ≥ 0 and integer
This is a mixed-integer  linear program.
Write the LP Relaxation for the problem but do not attempt to solve.
If required, round your answers to one decimal place.
Its LP Relaxation is
Max x1 + x2
s.t.
2x1 + x2 >  
x1 + 6x2 ≤  
x1 , x2 >  0 and x1 integer

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program....
Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program. Max 30x1 + 23x2 s.t. 3x1 + 1.7x2 ≤ 410 1.1x1 + 3x2 ≤ 260 1x1 + 1x2 ≤ 145 x1, x2 ≥ 0 and x2 integer This is a  linear program. Write the LP Relaxation for the problem but do not attempt to solve. If required, round your answers to one decimal place. Its LP Relaxation is: Max x1 + x2 s.t. x1 +...
Consider the following mixed-integer linear program. Max     3x1 + 4x2 s.t. 4x1 + 7x2 ≤ 28...
Consider the following mixed-integer linear program. Max     3x1 + 4x2 s.t. 4x1 + 7x2 ≤ 28 8x1 + 5x2 ≤ 40 x1, x2 ≥ and x1 integer (c) Find the optimal solution for the mixed-integer linear program. (Round your answers to three decimal places, when necessary.)
Consider the following LP problem: Minimize Cost = 3x1 + 2x2 s.t. 1x1 + 2x2 ≤...
Consider the following LP problem: Minimize Cost = 3x1 + 2x2 s.t. 1x1 + 2x2 ≤ 12 2x1 + 3 x2 = 12 2 x1 + x2 ≥ 8 x1≥ 0, x2 ≥ 0 What is the optimal solution of this LP? (0,8)(12,0)(4,0)(0,4)(2,3)(0,6)(3,2) I NEED SOLUTION!
Solve the following linear program using the simplex method: MAX 5X1 + 5X2 + 24X3 s.t....
Solve the following linear program using the simplex method: MAX 5X1 + 5X2 + 24X3 s.t. 15X1 + 4X2 + 12X3 <= 2800 15X1 + 8X2 <= 6000 X1 + 8X3 <= 1200 X1, X2, X3 >= 0
Solve The LP problem using the graphic method Z Max=15X1+10X2 Constaint function: 3X1 + 2X2 ≤...
Solve The LP problem using the graphic method Z Max=15X1+10X2 Constaint function: 3X1 + 2X2 ≤ 80 2X1 + 3X2 ≤ 70 X1≥ 0 , X2≥0
Solve The LP problem using the graphic method Z Max=5X1+3X2 Constaint function: 2X1 + 4X2 ≤...
Solve The LP problem using the graphic method Z Max=5X1+3X2 Constaint function: 2X1 + 4X2 ≤ 80 5X1 + 2X2 ≤ 80 X1≥ 0 , X2≥0
Solve the following linear programming model graphically and mathematically. Minimize C = 8x1 + 2x2 Subject...
Solve the following linear programming model graphically and mathematically. Minimize C = 8x1 + 2x2 Subject to 2x1 – 6x2 ≤ 12 5x1 + 4x2 ≥ 40 x1 +2x2 ≥ 12 x2 ≤ 6 x1, x2 ≥ 0
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £...
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £ 40                 3X1 + 5X2 £ 30                 3X1 + 3X2 £ 30                        2X2 £ 10                 X1 ³ 0, X2 ³ 0 (1)   Show each constraint and the feasible region by graphs. Indicate the feasible region clearly.   (5 points) (2)   Are there any redundant constraints? If so, what constraint(s) is redundant? (2 points) (3)   Identify the optimal point on your graph. What...
Solve the following LP problem graphically using level curves. MAX: 7 X1 + 4 X2 Subject...
Solve the following LP problem graphically using level curves. MAX: 7 X1 + 4 X2 Subject to: 2X1 + X2 ≤ 16 X1 + X2 ≤ 10 2X1 + 5 X2 ≤ 40 X1, X2 ≥ 0 a. X1 = 4 b. X1 = 6 c. X1 = 8 d. X1 = 10
Solve the following linear program using the simplex method. If the problem is two dimensional, graph...
Solve the following linear program using the simplex method. If the problem is two dimensional, graph the feasible region, and outline the progress of the algorithm. Minimize Z = 3X1 – 2X2 – X3 Subject to 4X1 + 5X2 – 2X3 ≤ 22                     X1 – 2X2 + X3 ≤ 30                     X1, X2, X3 ≥ 0