Consider the following integer linear programming problem Max Z =         3x1 + 2x2 Subject to:      3x1 + 5x2 ≤ 30                        4x1 + 2x2 ≤ 28                        x1 ≤ 8                        x1 , x2 ≥ 0 and integer   The solution to the Linear programming relaxation is: x1 = 5.714, x2 = 2.571. What is the optimal solution to the integer linear programming problem?

College Algebra (MindTap Course List)
12th Edition
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:R. David Gustafson, Jeff Hughes
Chapter6: Linear Systems
Section6.8: Linear Programming
Problem 34E
icon
Related questions
Question

Consider the following integer linear programming problem

Max Z =         3x1 + 2x2

Subject to:      3x1 + 5x2 ≤ 30

                       4x1 + 2x2 ≤ 28

                       x1 ≤ 8

                       x1 , x2 ≥ 0 and integer

 

The solution to the Linear programming relaxation is: x1 = 5.714, x2 = 2.571.

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

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage