Question

In: Computer Science

1. Consider the following linear program, where a and b are real-valued constants: max: x +...

1. Consider the following linear program, where a and b are real-valued constants:

max: x + y;
ax + by ≤ 1;
x ≥ 0;
y ≥ 0;

A) Suppose a < 0 and b < 0. Which one of these statements is true?

Group of answer choices

i) The linear program has a finite feasible region

ii) The linear program has an empty feasible region

iii) The feasible region is infinite, but there is an optimal solution

iv) The feasible region is infinite, and there is no optimal solution

B) Suppose a < 0 and b > 0. Which one of these statements is true?

Group of answer choices

i) The linear program has a finite feasible region

ii) The linear program has an empty feasible region

iii) The feasible region is infinite, but there is an optimal solution

iv) The feasible region is infinite, and there is no optimal solution

C) Suppose the linear program has a finite feasible region. In which one of the following cases will it not have a unique optimal solution?

Group of answer choices

i) a = b

ii) a < b

iii) a > b

iv) a ≠ b

Solutions

Expert Solution

max : x + y

subject to ax + by <=1 , x , y >=0

  • LP is never infeasible as the origin satisfies for any choice of a and b.
  • If a<=0 or b<=0. If a<=0 then we can increase x(and the objective function) arbitarily without violating any constraint. The same argument works for b and y. conversely, suppose both a and b are positive. Let m= min {a,b} and notice m>0. Then, m(x+y)<=ax+by<=1 , so that x+y <=1/m. Hence, the LP cannot be unbounded.

(A) i) The linear program has a finite feasible region.

  • the LP has a fnite optimal solution when a and b are positive. Suppose now a>b. Then, the optimal is clearly uniquely achieved at x=1/b.Similarly, if b>a, the unique optimum is x=1/a. However,if a==b, then any positive pair (x,y) such that x+y=1/a achieves the optimum. Hence,the optimum exists and is unique if and only if a,b are positive and a!=b.

(B) i) The linear program has a finite feasible region.

(c) iv)


Related Solutions

1. Consider the following linear program, where a and b are real-valued constants: max: x +...
1. Consider the following linear program, where a and b are real-valued constants: max: x + y; ax + by ≤ 1; x ≥ 0; y ≥ 0; A) Suppose a > 0 and b > 0. Which one of these statements is true? a) The linear program has a finite feasible region b) The linear program has an empty feasible region c) The feasible region is infinite, but there is an optimal solution d) The feasible region is infinite,...
Consider the following linear program:    MAX Z = 25A + 30B    s.t. 12A +...
Consider the following linear program:    MAX Z = 25A + 30B    s.t. 12A + 15B ≤ 300    8A + 7B ≤ 168 10A + 14B ≤ 280    Solve this linear program graphically and determine the optimal quantities of A, B, and the    value of Z. Show the optimal area.
Consider the following linear program:    MAX Z = 25A + 30B    s.t. 12A + 15B ≤...
Consider the following linear program:    MAX Z = 25A + 30B    s.t. 12A + 15B ≤ 300    8A + 7B ≤ 168   10A + 14B ≤ 280    Solve this linear program graphically and determine the optimal quantities of A, B, and the    value of Z. Show the optimal area.
Consider the following linear program: Max 4A + 6B s.t. 9A + 3B ≥ 20 3A...
Consider the following linear program: Max 4A + 6B s.t. 9A + 3B ≥ 20 3A + 5B ≤ 15 2A ≤ 6 A, B ≥ 0
Consider the following linear program Max 3A + 2B St 1A + 1B <= 10 3A...
Consider the following linear program Max 3A + 2B St 1A + 1B <= 10 3A + 1B <= 24 1A + 2B <= 16 A, B >= 0 The value of the optimal solution is 27. Suppose that the right hand side for constraint one is increased from 10 to 11. a) Use the graphical solution procedure to find the new optimal solution. b) Use the solution to part A to determine the shadow price for constraint 1 C)...
Consider the following all-integer linear program: Max x1 + x2 s.t. 4x1 + 6x2 ≤ 22...
Consider the following all-integer linear program: Max x1 + x2 s.t. 4x1 + 6x2 ≤ 22 x1 + 5x2 ≤ 15 2x1 + x2 ≤ 9   x1, x2 ≥ 0 and integer Solve the LP Relaxation of this problem. The optimal solution to the LP Relaxation is x1 = ___, x2 = .____________ Its value is ___________ Find the optimal integer solution. The optimal solution to the LP Relaxation is x1 = _____x2 = __________ Its value is _______
44. Consider the following linear program Max 1a+1b s.t. 5a+3b<15 3a+5b,<15 a,b >0 A. What is...
44. Consider the following linear program Max 1a+1b s.t. 5a+3b<15 3a+5b,<15 a,b >0 A. What is the optimal solution for this problem? B. Suppose that the objective function is changed to 1a+2b. Find the new optimal solution. I am using excel for this homework question so I need the formulas to help not just the answers and I also trying to figure desmos to graph the question.
Consider the following all-integer linear program: Max 5x1 +8x2 s.t.   6x1 + 5x2 <= 30 9x1...
Consider the following all-integer linear program: Max 5x1 +8x2 s.t.   6x1 + 5x2 <= 30 9x1 + 4x2 <= 36 1x1 + 2x2 <=10 x1, x2 $ 0 and integer a. Graph the constraints for this problem. Use dots to indicate all feasible integer solutions. b. Find the optimal solution to the LP Relaxation. Round down to find a feasible integer solution. c. Find the optimal integer solution. Is it the same as the solution obtained in part (b) by...
Prove the Following: Where a and b are constants. a). Σ(?−?̅)=0 b). Var( a + bX)...
Prove the Following: Where a and b are constants. a). Σ(?−?̅)=0 b). Var( a + bX) = b2Var(X)
Consider the Cobb-Douglas production function ?=??^??^??^? where ?, ?, ?, ? are positive constants and ?+?+?<1....
Consider the Cobb-Douglas production function ?=??^??^??^? where ?, ?, ?, ? are positive constants and ?+?+?<1. Let ? be the amount of labor, ? the amount of capital, and ? be the amount of other materials used. Let the profit function be defined by ?=?−(??+??+??) where the costs of labor, capital, and other materials are, respectively, ?, ?, and ?. Determine whether second order conditions for profit maximization hold, when the profit function is defined by ?=?−(30?+20?+10?) with ?=5?^0.3?^0.4?^0.2.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT