4. Give an example of an LP for which the feasible region is unbounded, but the optimal objective value is finite.
one such example is
Maximise x w.r.t
x>=0 and y>=0 -- eqn 1
x/3+2/3y>=1 --eqn 2
and x/(-1)+2y<=1 --eqn 3
the feasible region extends to the right till infinity but the optimal value is the x coordinate of the intersection of two eq2 and eq3
Here's an example of a linear programming problem where the feasible region is unbounded, but the optimal objective value is finite:
vbnetCopy codeMaximize: 2x + y Subject to: x + 2y <= 4 x >= 0 y >= 0
The feasible region of this problem is unbounded because there is no upper limit on the value of y. As x increases, y can increase without limit, and the feasible region extends infinitely in the positive y direction.
However, the optimal objective value of this problem is finite. The objective function 2x + y can be maximized by setting x = 0 and y = 2, which satisfies the constraints and gives an optimal objective value of 2. Therefore, the feasible region is unbounded, but the optimal objective value is finite.
4. Give an example of an LP for which the feasible region is unbounded, but the...
Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. HINT [See Example 1.] (Enter EMPTY if the region is empty. Enter UNBOUNDED if the function is unbounded.) Minimize c = x + y subject to x + 5y ≥ 6 5x + y ≥ 6 x ≥ 0, y ≥ 0. c = x = y =
Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. HINT (See Example 1.] (Enter EMPTY if the region is empty. Enter UNBOUNDED if the function is unbounded.) Minimize c = 8x - By subject to 7 sy ys 2x x + y27 x + 2y = 16 x>0, y 2 0. c= (x,y) = ((
Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. HINT [See Example 1.] (Enter EMPTY if the region is empty. Enter UNBOUNDED if the function is unbounded.) a)Maximize p = 3x + 2y subject to −4x+y≥10 x+3y≤12 x ≥ 0, y ≥ 0 p= (x,y)= b) Maximize and minimize p = x + 2y subject to x + y ≥ 6 x + y ≤ 8 x...
Solve the given linear programming problem using the simplex method. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. (Enter EMPTY if the feasible region is empty and UNBOUNDED if the objective function is unbounded.) Minimize c = x + y + z + w subject to x + y ≥ 80 x + z ≥ 60 x + y − w ≤ 50 y + z − w ≤ 50...
Give an example of an Integer Linear program which has no feasible integer solutions, but its LP relaxation has a feasible set in R2 of area at least 10
Give an example of an Integer Linear program which has no feasible integer solutions, but its LP relaxation has a feasible set in R2 of area at least 10
For Questions 1, consider the following classifications: Feasible Region I- Finite Line Segment II -Non-existent III - Polygon IV-Single Point V - Unbounded Optimal Solution A -Alternate Optima B-No feasible solution C- Unbounded D-Unique 1. Suppose an LP with 5 regular constraints (other than the non-negativity constraints) has "lr as its feasible region. If a new constraint is added, which of the following CANNOT be the type of the new optimal solution? a, A b. В с. С d. De,...
Match the following terms to their definition Feasible region Binding constraint [Choose] [Choose A feasible solution for which there are no other feasible points with a better objective function value in the entire feasible region. The change in the optimal objective function value per unit increase in the right-hand side of a constraint Restrictions that limit the settings of the decision variables A controllable input for a linear programming model The expression that defines the quantity to be maximized or...
Consider the following LP problem. MAX: 9X1-8X2 Subject to: x1+x2≤6 -x1+x2≤3 3x1-6x2≤4 x1,x2≥0 Sketch the feasible region for this model. What is the optimal solution? What is the optimal solution if the objective function changes to Max.-9x1+8x2?
Consider the following LP z= 2x1-x2 st s r 22 0 1. Prove the feasible region of the above LP is convex set. (Note: You could not prove using graphical representation) (2 points) 2. Find extreme directions of the feasible region. (2 points)
Consider the following LP z= 2x1-x2 st s r 22 0 1. Prove the feasible region of the above LP is convex set. (Note: You could not prove using graphical representation) (2 points) 2. Find extreme directions...
Consider the following LP problem: Minimize Cost = 3x1 + 2x2 s.t. 1x1 + 2x2 ≤ 12 2x1 + 3 x2 = 12 2 x1 + x2 ≥ 8 x1≥ 0, x2 ≥ 0 A) What is the optimal solution of this LP? Give an explanation. (4,0) (2,3) (0,8) (0,4) (0,6) (3,2) (12,0) B)Which of the following statements are correct for a linear programming which is feasible and not unbounded? 1)All of the above. 2)Only extreme points may be optimal....