Min problem:

For a min problem, an LP is unbounded if there is a variable with a positive coefficient in Row 0 that has a non-positive coefficient in each constraint.

Here the optimal table is

z x1 x2 s1 s2 RHS
1 2 3 0 0 0
0 1 -1 1 0 1
0 1 -2 0 1 2

Here x₂ is as large as desired.

Since each unit by which x₂ is increased decreases z by 3 units.

Hence z is taken as small as desired...

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 4.7, Problem 4P

Chapter 4.7, Problem 6P

Students have asked these similar questions

It is unclear why each LP has an optimal fundamental feasible solution.

Why any LP with an optimal solution has an optimal basic feasible solution?

In regards of the problem:max cTx subject to Ax = b, with an optimal solution of value v. Suppose the problem min cT x, subject to Ax = b have great with the same value, v. It can be concluded that there is a singlegood point for both? How is the feasible region geometrically?

Chapter 4 Solutions

Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms

Ch. 4.1 - Prob. 1P Ch. 4.1 - Prob. 2P Ch. 4.1 - Prob. 3P Ch. 4.4 - Prob. 1P Ch. 4.4 - Prob. 2P Ch. 4.4 - Prob. 3P Ch. 4.4 - Prob. 4P Ch. 4.4 - Prob. 5P Ch. 4.4 - Prob. 6P Ch. 4.4 - Prob. 7P

Ch. 4.5 - Prob. 1P Ch. 4.5 - Prob. 2P Ch. 4.5 - Prob. 3P Ch. 4.5 - Prob. 4P Ch. 4.5 - Prob. 5P Ch. 4.5 - Prob. 6P Ch. 4.5 - Prob. 7P Ch. 4.6 - Prob. 1P Ch. 4.6 - Prob. 2P Ch. 4.6 - Prob. 3P Ch. 4.6 - Prob. 4P Ch. 4.7 - Prob. 1P Ch. 4.7 - Prob. 2P Ch. 4.7 - Prob. 3P Ch. 4.7 - Prob. 4P Ch. 4.7 - Prob. 5P Ch. 4.7 - Prob. 6P Ch. 4.7 - Prob. 7P Ch. 4.7 - Prob. 8P Ch. 4.7 - Prob. 9P Ch. 4.8 - Prob. 1P Ch. 4.8 - Prob. 2P Ch. 4.8 - Prob. 3P Ch. 4.8 - Prob. 4P Ch. 4.8 - Prob. 5P Ch. 4.8 - Prob. 6P Ch. 4.10 - Prob. 1P Ch. 4.10 - Prob. 2P Ch. 4.10 - Prob. 3P Ch. 4.10 - Prob. 4P Ch. 4.10 - Prob. 5P Ch. 4.11 - Prob. 1P Ch. 4.11 - Prob. 2P Ch. 4.11 - Prob. 3P Ch. 4.11 - Prob. 4P Ch. 4.11 - Prob. 5P Ch. 4.11 - Prob. 6P Ch. 4.12 - Prob. 1P Ch. 4.12 - Prob. 2P Ch. 4.12 - Prob. 3P Ch. 4.12 - Prob. 4P Ch. 4.12 - Prob. 5P Ch. 4.12 - Prob. 6P Ch. 4.13 - Prob. 2P Ch. 4.14 - Prob. 1P Ch. 4.14 - Prob. 2P Ch. 4.14 - Prob. 3P Ch. 4.14 - Prob. 4P Ch. 4.14 - Prob. 5P Ch. 4.14 - Prob. 6P Ch. 4.14 - Prob. 7P Ch. 4.16 - Prob. 1P Ch. 4.16 - Prob. 2P Ch. 4.16 - Prob. 3P Ch. 4.16 - Prob. 5P Ch. 4.16 - Prob. 7P Ch. 4.16 - Prob. 8P Ch. 4.16 - Prob. 9P Ch. 4.16 - Prob. 10P Ch. 4.16 - Prob. 11P Ch. 4.16 - Prob. 12P Ch. 4.16 - Prob. 13P Ch. 4.16 - Prob. 14P Ch. 4.17 - Prob. 1P Ch. 4.17 - Prob. 2P Ch. 4.17 - Prob. 3P Ch. 4.17 - Prob. 4P Ch. 4.17 - Prob. 5P Ch. 4.17 - Prob. 7P Ch. 4.17 - Prob. 8P Ch. 4 - Prob. 1RP Ch. 4 - Prob. 2RP Ch. 4 - Prob. 3RP Ch. 4 - Prob. 4RP Ch. 4 - Prob. 5RP Ch. 4 - Prob. 6RP Ch. 4 - Prob. 7RP Ch. 4 - Prob. 8RP Ch. 4 - Prob. 9RP Ch. 4 - Prob. 10RP Ch. 4 - Prob. 12RP Ch. 4 - Prob. 13RP Ch. 4 - Prob. 14RP Ch. 4 - Prob. 16RP Ch. 4 - Prob. 17RP Ch. 4 - Prob. 18RP Ch. 4 - Prob. 19RP Ch. 4 - Prob. 20RP Ch. 4 - Prob. 21RP Ch. 4 - Prob. 22RP Ch. 4 - Prob. 23RP Ch. 4 - Prob. 24RP Ch. 4 - Prob. 26RP Ch. 4 - Prob. 27RP Ch. 4 - Prob. 28RP

Knowledge Booster

Learn more about

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

Similar questions

Solve the following graphically: Max z = 3x1 + 4x2 subject to x1 + 2x2 ≤ 16 2x1 + 3x2 ≤ 18 x1 ≥ 2 x2 ≤ 10 x1, x2 ≥ 0 What are the optimal values of x1, x2, and z? Group of answer choices x1 = 93, x2 = 0, z = 48 x1 = 19, x2 = 0, z = 32 x1 = 10, x2 = 0, z = 27 x1 = 9, x2 = 0, z = 27 x1 = 9, x2 = 3, z = 30 x1 = 12, x2 = 6, z = 42
If 142 and 155 are two feasible solutions for a primal minimization problem, whereas 122 and 130 are two feasible solutions for the associated dual maximization problem. Which of the following statements is the most correct? 122 <= Optimal solution <= 155 O b. 122 <= Optimal solution <= 142 D DC 130 <= Optimal solution <= 142 Od 130 <= Optimal solution <= 155
Consider the following linear programming model: Max 2X1 + 3X2 Subject to: X1 ≤ 2 X2 ≤ 3 X1 ≤ 1 X1, X2 ≥ 0 This linear programming model has: a. alternate optimal solutions b. infeasible solution c. redundant constraint d. unbounded solution

Recommended textbooks for you

Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole

Operations Research : Applications and Algorithms

Computer Science

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Brooks Cole

SEE MORE TEXTBOOKS

Solution Summary: The author explains that an LP is unbounded if there is a variable with positive coefficient in Row 0 that has non-positive coefficients in each constraint.

Concept explainers

Explanation of Solution

Want to see the full answer?

Chapter 4 Solutions