Consider the following all-integer linear program. Max 1x1 + 1x2 s.t. 5x1 + 7x2 ≤ 42 1x1 + 6x2 ≤ 18 2x1 + 1x2 ≤ 15 x1, x2 ≥ 0 and integer (a) Graph the constraints for this problem. Use dots to indicate all feasible integer solutions. On the coordinate plane the horizontal axis is labeled x₁ and the vertical axis is labeled x₂. A region bounded by a series of connected line segments and several points are on the graph. The line segments connect the approximate points (0, 7.5), (1, 7), (2.09, 5.48), and (3, 0). The region is above the horizontal axis, to the right of the vertical axis, and below the line segments. All ordered pairs with integer values in the region, on the series of connected line segments, but not on the horizontal nor vertical axes, are shown. On the coordinate plane the horizontal axis is labeled x₁ and the vertical axis is labeled x₂. A region bounded by a series of connected line segments and several points are on the graph. The line segments connect the approximate points (0, 3), (5.48, 2.09), (7, 1), and (7.5, 0). The region is above the horizontal axis, to the right of the vertical axis, and below the line segments. All ordered pairs with integer values in the region, on the series of connected line segments, but not on the horizontal nor vertical axes, are shown. On the coordinate plane the horizontal axis is labeled x₁ and the vertical axis is labeled x₂. A region bounded by a series of connected line segments and several points are on the graph. The line segments connect the approximate points (0, 3), (5.48, 2.09), (7, 1), and (7.5, 0). The region is above the horizontal axis, to the right of the vertical axis, and below the line segments. All ordered pairs with integer values in the region and on its boundaries are shown. On the coordinate plane the horizontal axis is labeled x₁ and the vertical axis is labeled x₂. A region bounded by a series of connected line segments and several points are on the graph. The line segments connect the approximate points (0, 7.5), (1, 7), (2.09, 5.48), and (3, 0). The region is above the horizontal axis, to the right of the vertical axis, and below the line segments. All ordered pairs with integer values in the region and on its boundaries are shown. (b) Solve the LP Relaxation of this problem. 4 at (x1, x2) = 4.2,0.6 (c) Find the optimal integer solution. at (x1, x2) = 0,7

Consider the following all-integer linear program. Max 1x1 + 1x2 s.t. 5x1 + 7x2 ≤ 42 1x1 + 6x2 ≤ 18 2x1 + 1x2 ≤ 15 x1, x2 ≥ 0 and integer (a) Graph the constraints for this problem. Use dots to indicate all feasible integer solutions. On the coordinate plane the horizontal axis is labeled x₁ and the vertical axis is labeled x₂. A region bounded by a series of connected line segments and several points are on the graph. The line segments connect the approximate points (0, 7.5), (1, 7), (2.09, 5.48), and (3, 0). The region is above the horizontal axis, to the right of the vertical axis, and below the line segments. All ordered pairs with integer values in the region, on the series of connected line segments, but not on the horizontal nor vertical axes, are shown. On the coordinate plane the horizontal axis is labeled x₁ and the vertical axis is labeled x₂. A region bounded by a series of connected line segments and several points are on the graph. The line segments connect the approximate points (0, 3), (5.48, 2.09), (7, 1), and (7.5, 0). The region is above the horizontal axis, to the right of the vertical axis, and below the line segments. All ordered pairs with integer values in the region, on the series of connected line segments, but not on the horizontal nor vertical axes, are shown. On the coordinate plane the horizontal axis is labeled x₁ and the vertical axis is labeled x₂. A region bounded by a series of connected line segments and several points are on the graph. The line segments connect the approximate points (0, 3), (5.48, 2.09), (7, 1), and (7.5, 0). The region is above the horizontal axis, to the right of the vertical axis, and below the line segments. All ordered pairs with integer values in the region and on its boundaries are shown. On the coordinate plane the horizontal axis is labeled x₁ and the vertical axis is labeled x₂. A region bounded by a series of connected line segments and several points are on the graph. The line segments connect the approximate points (0, 7.5), (1, 7), (2.09, 5.48), and (3, 0). The region is above the horizontal axis, to the right of the vertical axis, and below the line segments. All ordered pairs with integer values in the region and on its boundaries are shown. (b) Solve the LP Relaxation of this problem. 4 at (x1, x2) = 4.2,0.6 (c) Find the optimal integer solution. at (x1, x2) = 0,7

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Related questions

Concept explainers

Question

100%

Consider the following all-integer linear program.

Max	1x₁	+	1x₂
s.t.
	5x₁	+	7x₂ ≤	42
	1x₁	+	6x₂ ≤	18
	2x₁	+	1x₂ ≤	15
x₁, x₂ ≥ 0 and integer

(a)

Graph the constraints for this problem. Use dots to indicate all feasible integer solutions.

On the coordinate plane the horizontal axis is labeled x₁ and the vertical axis is labeled x₂. A region bounded by a series of connected line segments and several points are on the graph.

The line segments connect the approximate points (0, 7.5), (1, 7), (2.09, 5.48), and (3, 0).
The region is above the horizontal axis, to the right of the vertical axis, and below the line segments.
All ordered pairs with integer values in the region, on the series of connected line segments, but not on the horizontal nor vertical axes, are shown.

On the coordinate plane the horizontal axis is labeled x₁ and the vertical axis is labeled x₂. A region bounded by a series of connected line segments and several points are on the graph.

The line segments connect the approximate points (0, 3), (5.48, 2.09), (7, 1), and (7.5, 0).
The region is above the horizontal axis, to the right of the vertical axis, and below the line segments.
All ordered pairs with integer values in the region, on the series of connected line segments, but not on the horizontal nor vertical axes, are shown.

On the coordinate plane the horizontal axis is labeled x₁ and the vertical axis is labeled x₂. A region bounded by a series of connected line segments and several points are on the graph.

The line segments connect the approximate points (0, 3), (5.48, 2.09), (7, 1), and (7.5, 0).
The region is above the horizontal axis, to the right of the vertical axis, and below the line segments.
All ordered pairs with integer values in the region and on its boundaries are shown.

On the coordinate plane the horizontal axis is labeled x₁ and the vertical axis is labeled x₂. A region bounded by a series of connected line segments and several points are on the graph.

The line segments connect the approximate points (0, 7.5), (1, 7), (2.09, 5.48), and (3, 0).
The region is above the horizontal axis, to the right of the vertical axis, and below the line segments.
All ordered pairs with integer values in the region and on its boundaries are shown.

(b)

Solve the LP Relaxation of this problem.

4 at

(x₁, x₂) =

4.2,0.6

(c)

Find the optimal integer solution.

(x₁, x₂) =

0,7

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 8 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.