Suppose we are solving a maximization linear program, and we arrive at the following simplex tableau in which some numbers have been replaced by constants p and q. z X1 x2 x3 X4 |x5 RHS Row 이1 ||0 ||0 |p||q|0 || 105 Row 1 0 0 1 0 2 o 42 Row 2 0 0 0 |-21 1 39 Row 30 1 o |-3|-2 0 6 If the current tableau is to indicate that the linear program is unbounded, what conditions must be satisfied? Op<0 andq20 O p<0 and q s0 O p<0 and q = 0 p< 0 (i.e., it doesn't matter what value q takes)

Algebra: Structure And Method, Book 1
(REV)00th Edition
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Chapter10: Inequalities
Section10.8: Systems Of Linear Inequalities
Problem 2E
icon
Related questions
Question
Suppose we are solving a maximization linear program, and we arrive at the following simplex tableau in which some numbers have
been replaced by constants p and q.
z x1 x2 x3 X4 X5 RHS
|Row 이| 1 ||0 ||0 |p ||q |0 || 105
Row 1 0 0 1 0 2 0 42
Row 2 0 0 o |-2 1 1 39
Row 3 0 1 o -3 -2 0 6
If the current tableau is to indicate that the linear program is unbounded, what conditions must be satisfied?
Op<0 and q 2 0
Op<0 and g s0
O p<0 and q = 0
Op<0 (i.e., it doesn't matter what value q takes)
QUESTION 2
Suppose we are solving a maximization linear program, and we arrive at the following simplex tableau in which some numbers
have been replaced by constants p and q.
z X1x2 X3 X4x5 RHS
||Row 이1 ||0 ||0 |p ||q ||0 || 105
Row 10 0 1 0 2 042
Row 2 0 00 -2 1 1 39
Row 30 1 0 |-3 |-2 0 6
Suppose you enter x3, which will move you in a certain direction from the current basic feasible solution. By moving in this direction, it is
possible to compute a feasible solution with objective value 105 - 2p. For this solution, what is the value of x5? (Enter a numerical value.
Your answer must be correct within +/- 0.01.)
Transcribed Image Text:Suppose we are solving a maximization linear program, and we arrive at the following simplex tableau in which some numbers have been replaced by constants p and q. z x1 x2 x3 X4 X5 RHS |Row 이| 1 ||0 ||0 |p ||q |0 || 105 Row 1 0 0 1 0 2 0 42 Row 2 0 0 o |-2 1 1 39 Row 3 0 1 o -3 -2 0 6 If the current tableau is to indicate that the linear program is unbounded, what conditions must be satisfied? Op<0 and q 2 0 Op<0 and g s0 O p<0 and q = 0 Op<0 (i.e., it doesn't matter what value q takes) QUESTION 2 Suppose we are solving a maximization linear program, and we arrive at the following simplex tableau in which some numbers have been replaced by constants p and q. z X1x2 X3 X4x5 RHS ||Row 이1 ||0 ||0 |p ||q ||0 || 105 Row 10 0 1 0 2 042 Row 2 0 00 -2 1 1 39 Row 30 1 0 |-3 |-2 0 6 Suppose you enter x3, which will move you in a certain direction from the current basic feasible solution. By moving in this direction, it is possible to compute a feasible solution with objective value 105 - 2p. For this solution, what is the value of x5? (Enter a numerical value. Your answer must be correct within +/- 0.01.)
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
Algebra: Structure And Method, Book 1
Algebra: Structure And Method, Book 1
Algebra
ISBN:
9780395977224
Author:
Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:
McDougal Littell