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

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 profit for activity 2 is $2,000.

(a) Calculate the total profit for each CPF solution. Use this information to find an optimal solution.

(b) Use the solution concepts of the simplex method given in Sec. 4.1 to identify the sequence of CPF solutions that would be examined by the simplex method to reach an optimal solution.

8 (0,6 ) 6 (5, 5) 4 (6. 4) Feasible 2 (8,0) 0 2 4 6 Level of Activity 1

Step by Step Solution

★★★★★

3.44 Rating (163 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock

a Optimal Solution A 1 A 2 5 5 with Z 15000 b Initiated ... 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 (345).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!

You are given the following data for a linear programming problem where the objective is to maximize the profit from allocating three resources to two nonnegative activities. Contribution per unit =...

Consider a two-variable mathematical programming problem that has the feasible region shown on the graph, where the six dots correspond to CPF solutions. The problem has a linear objective function,...

Consider a problem with two decision variables, x1 and x2, which represent the levels of activities 1 and 2, respectively. For each variable, the permissible values are 0, 1, and 2, where the...

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...

4 . 1 - 3 . 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...

operation research vous Exercise 2: A certain LP model involving two activities has the feasible region shown below. The objective is to maximize the total profit from the two activities. The unit...

Using Simplex method Question 4.1.2 By hand please PROBLEMS The symbols to the left of some of the problems for their parts) and have the following meaning: x 20. *320 D. The corresponding...

Question 4.1.2 Using complex method PROBLEMS The symbols to the left of some of the problems for their parts) and have the following meaning: x 20. *320 D. The corresponding demonstration cxample...

Using semlex method Question 4.1.2 By hand please PROBLEMS The symbols to the left of some of the problems for their parts) and have the following meaning: x 20. *320 D. The corresponding...

4.1-3. A certain linear programming model involving two activi- ties has the feasible region shown below. 8 (5,5) Level of Activity 2 (6,4) Feasible region 2 (8,0) 0 2 8 4 6 Level of Activity 1 The...

A company reports the following information as of December 31: Sales revenue $950,000 Cost of goods sold 750,000 Operating expenses 85,000 Unrealized holding gain on available-for-sale debt...

PT Toys is a company engaged in the children's toy industry. This year, PT Toys plans to increase its sales overseas. To realize this plan, PT Toys must have a large enough capital. To get the...

1. What is required from forecasting in the following cases: (a) Stock holding for a manufacturer of FMCG (fast-moving consumer goods). (b) A make to order just-in-time product supplier. (c) A mail...

Apply the various schools of thought, and see if you can fit Mr. Greenberg into one or more. As you do, think about the following excerpt from an editorial Mr. Greenberg wrote for the Wall Street...

Consider the following quadratic programming problem: Maximize f(x) 20x1 20x1 2 50x2 5x2 2 18x1x2, subject to x1 x2 6 x1 4x2 18 and x1 0, x2 0. Suppose that this problem is to be solved by the...

Consider the following quadratic programming problem. Maximize f(x) 2x1 3x2 x1 2 x2 2 , subject to x1 x2 2 and x1 0, x2 0. (a) Use the KKT conditions to derive an optimal solution directly. (b)...

Reconsider the first quadratic programming variation of the Wyndor Glass Co. problem presented in Sec. 13.2 (see Fig. 13.6). Analyze this problem by following the instructions of parts (a), (b), and...

4. Consider the simple random walk {X,} on the set of integers Z satisfying the following. The initial state is Xo = 0 and on each step the process moves one step to the right (+1) with probability...

Help out with the following questions Nationally, patients who go to the emergency room wait an average of 6 hours to be admitted into the hospital. Do patients at rural hospitals have a higher...

what is cyber security framework