# Question

Suppose that the following constraints have been provided for a linear programming model with decision variables x1 and x2.

and

x1 ≥ 0, x2 ≥ 0.

(a) Demonstrate graphically that the feasible region is unbounded.

and

x1 ≥ 0, x2 ≥ 0.

(a) Demonstrate graphically that the feasible region is unbounded.

## Answer to relevant Questions

A certain linear programming model involving two activities has the feasible region shown below. The objective is to maximize the total profit from the two activities. The unit profit for activity 1 is $1,000 and the unit ...Consider a two-variable linear programming problem whose CPF solutions are (0, 0), (6, 0), (6, 3), (3, 3), and (0, 2). (See Prob. 3.2-2 for a graph of the feasible region.) (a) Use the graph of the feasible region to ...Consider the following problem. Maximize Z = 90x1 + 70x2, Subject to and x1 ≥ 0, x2 ≥ 0. Consider the following problem. Maximize Z = –x1 + 4x2, Subject to (No lower bound constraint for x1). (a) Solve this problem graphically. (b) Reformulate this problem so that it has only two functional constraints and all ...Consider the following problem. Maximize z = x1 – 7x2 + 3x3, Subject to and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. (a) Work through the simplex method step by step to solve the problem. (b) Identify the shadow prices for the three ...Post your question

0