Question: 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

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 identify all the constraints for the model.
(b) For each pair of adjacent CPF solutions, give an example of an objective function such that all the points on the line segment between these two corner points are multiple optimal solutions.
(c) Now suppose that the objective function is Z = - x1 + 2x2. Use the graphical method to find all the optimal solutions.
(d) For the objective function in part (c), work through the simplex method step by step to find all the optimal BF solutions. Then write an algebraic expression that identifies all the optimal solutions.

Step by Step Solution

★★★★★

3.34 Rating (178 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

a x i 6 x 2 3 x 1 3x 2 6 b Unit Profit Prod 1 Unit Profit Prod2 ... View full answer

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Document Format (1 attachment)

545-M-S-L-P (350).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!

Consider the three-variable linear programming problem shown in Fig. 5.2. (a) Explain in geometric terms why the set of solutions satisfying any individual constraint is a convex set, as defined in...

Suppose that the three-variable linear programming problem given in Fig. 5.2 has the objective function Maximize Z = 3x1 + 4x2 + 3x3. Without using the algebra of the simplex method, apply just its...

Consider the three-variable linear programming problem shown in Fig. 5.2. Discuss.

4.5-7 Consider a two-variable linear programming problem whose CPF solutions are (0, 0), (6,0), (6, 3), (3, 3), and (0, 2). The feasible region graph is given below. X2 (3, 3) (6,3) (0,2) (0,0) (6,0)...

Consider a two-variable linear programming problem whose CPF solutions are (0,0),(6,0), (6,3),(3,3), and (0,2). (a) Graph the feasible region and identify all the constraints for the model. (See...

operation research course Consider a two-verlable linear programming problem whose CPF solutions are (0,0).(6.0), (6, 31.8., and (0, 2). The feasible region graph is given below (3.3) (0.2) (0,0)...

Consider a two-variable linear programming problem whose corner point feasible (CPF) solutions are (0,0), (6,0), (6,2), (4,4), and (0.2). See the feasible region below. a) Use the graph of the...

Consider a two-variable linear programming problem whose corner point feasible (CPF) solutions are (0,0), (6,0), (6,2), (4,4), and (0,2). See the feasible region below. a) Use the graph of the...

Lnyben?s original proposal (1994) for the Alternative 2 control structure incorporated a reactor level controller using F 0 as the manipulated variable. However, the level controller prevents...

In tropical climates, the water near the surface of the ocean remains warm throughout the year as a result of solar energy absorption. In the deeper parts of the ocean, however, the water remains at...

Which of the fallowing statements about gross profit is correct? Mutple Choice Gross profit = Net sales - Cost of goods sold. Gross proit is recorded by a credit to the Gross Profit account, A...

Give some examples, other than the speeding example in the reading, of the types of things we do that we are able to feel comfortable with because Everybody does it.

Consider the following nonlinear programming problem (first considered in Prob. 11.3-23). Maximize Z 5x1 x2, subject to 2x1 2 x2 13 x1 2 x2 9 and x1 0, x2 0. (a) Show that this problem is a convex...

Consider the following convex programming problem: Maximize Z 32x1 x1 4 4x2 x2 2 , subject to x1 2 x2 2 9 and x1 0, x2 0. (a) Apply the separable programming technique discussed at the end of...

Reconsider the integer nonlinear programming model given in Prob. 11.3-11. (a) Show that the objective function is not concave. (b) Formulate an equivalent pure binary integer linear programming...

We will derive a two-state call option value in this problem. Data: S0=$110;X=$120;1+r=1.10. The two possibilities for ST are $140 and $100. The portfolio consists of 2 shares of stock and 4 calls...

Consider the following financial statement information for the Amaryliss Corporation: Item Beginning Ending Inventory $11,282 $12,080 Accounts receivable 6,551 7,081 Accounts payable 6,852 7,193 Net...

I'm writing a a code in html that looks like a website. I need to write a search label and text input that looks like the one on the photo attached and I can't seem to be able to do it. please help....