Consider the following all-integer linear program: Max x1+x2 s.t 4x1+6x2 <= 22 x1+5x2<= 15 2x1+x2<=9 x1,x2>=0...

Question

Question

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

s.t 4x1+6x2 <= 22

x1+5x2<= 15

2x1+x2<=9

x1,x2>=0 integer

Solve in Excel Solver and AMPL.

business Operations-Management

Answer 1

Answer #1

Objective Function

Max Z = x₁+x₂

Constraints

4x₁+6x₂ <= 22

x₁+5x₂ <= 15

2x₁+x₂ <=9

x₁,x₂ >= 0 integer

Configure in Excel as below -

The blue cells needs to be optimized to get the max value in green cell

Run solver to get

Answer 2

Similar Homework Help Questions

Linear Programming question

Solve the following Integer Linear Programming Problem graphically using the method presented in class. Indicate whether problem is unbounded, infeasible and if an optimal solution exists, clearly state what the solution is. MAX Z = X1 + 2X2ST 4X1 + 6X2 ≤ 22 X1 + 5X2 ≤ 15 2X1 + X2 ≤ 9 X1, X2 ≥ 0 and X1 integer
Use the simplex algorithm to find all optimal solutions to the following LP. max z=2x1+x2 s.t....

Use the simplex algorithm to find all optimal solutions to the following LP. max z=2x1+x2 s.t. 4x1 + 2x2 ≤ 4 −2x1 + x2 ≤ 2 x1 ≥1 x1,x2 ≥0
Max 4x1 - 22 + 2.T3 Subiect to: 2x1 + x2 7 Min 4 + 2x2 - T3 Subject to: x1 + 2x2-6

Determine the Dual of the following Linear Programming Problems Max 4x1 - 22 + 2.T3 Subiect to: 2x1 + x2 7 Min 4 + 2x2 - T3 Subject to: x1 + 2x2-6 Max 4x1 - 22 + 2.T3 Subiect to: 2x1 + x2 7 Min 4 + 2x2 - T3 Subject to: x1 + 2x2-6

Min 2x1 + x2 s.t. x1 + x2 ≥ 4 x1 – x2 ≥ 2 x1...

Min 2x1 + x2 s.t. x1 + x2 ≥ 4 x1 – x2 ≥ 2 x1 – 2x2 ≥ –1 x1 ≥ 0, x2 ≥ 0 Please solve the linear program graphically, showing the objective function, all constraints, the feasible region and marking all basic solutions (distinguishing the ones that are feasible).
Consider the following LP max z=3x1+x2 s.t. −2x1 + x2 ≤ 3 x1 + 2x2 ≤...

Consider the following LP max z=3x1+x2 s.t. −2x1 + x2 ≤ 3 x1 + 2x2 ≤ 5 x1,x2 ≥0 (a) Find the dual (or shadow) prices of the binding constraints (b) Find the dual (or shadow) prices of the binding “dual” constraints.
Consider the following linear program: Max Z = X1 – 2X2 Subject to – 4X1 +...

Consider the following linear program: Max Z = X1 – 2X2 Subject to – 4X1 + 3X2 <= 3 X1 – X2 <= 3 X1, X2 >= 0 a) Graph the feasible region for the problem. b) Is the feasible region unbounded? Explain. c) Find the optimal solution. d) Does an unbounded feasible region imply that the optimal solution to the linear program will be unbounded?

Consider the mathematical program max 3x1 x2 +3x3 s.t. 2X1 + X2 + X3 +X4-2 x1...

Consider the mathematical program max 3x1 x2 +3x3 s.t. 2X1 + X2 + X3 +X4-2 x1 + 2x2 + 3x3 + 2xs 5 2x1 + 2x2 + x3 + 3x6 = 6 Three feasible solutions ((a) through (c)) are listed below. (b) xo) (0.9, 0, 0, 0.2,2.05, 1.4) (c) xo) (0.3, 0.1, 0.4, 0.9, 1.65, 1.6) Please choose one appropriate interior point from the list, and use the Karmarkar's Method at the interior point and determine the optimal solution.
Find the maximum value of Z= 4X1 + 6X2 where X1 , X2 ≥ 0 and...

Find the maximum value of Z= 4X1 + 6X2 where X1 , X2 ≥ 0 and subject to the following constraints. - X1+ X2 ≤ 11 X1+ X2 ≤ 27 2X1+5 X2 ≤ 90
Conside the following linear programming problem Maximize $4X1 + $8X2 Subject To 2X1 + 5X2 ≤50...

Conside the following linear programming problem Maximize $4X1 + $8X2 Subject To 2X1 + 5X2 ≤50 Constraint A 3X1 + 3X2 ≤ 48 Constraint B X1, X2 ≥ 0 Constraint C

Using the dual simplex, please solve the following linear program min z = x1 +x2 s.t. 2x tx2 5 2x1 + 3x2 26 (all x's are nonnegative) Using the dual simplex, please solve the following l...

Using the dual simplex, please solve the following linear program min z = x1 +x2 s.t. 2x tx2 5 2x1 + 3x2 26 (all x's are nonnegative) Using the dual simplex, please solve the following linear program min z = x1 +x2 s.t. 2x tx2 5 2x1 + 3x2 26 (all x's are nonnegative)