Explanation Given: The problem Maximize P = 2 x + 2 y − 4 z Subject to 3 x + 3 y − 2 z ≤ 100 …… ( 1 ) 5 x + 5 y + 3 z ≤ 150 …… ( 2 ) x ≥ 0 , y ≥ 0 , z ≥ 0 Approach: Approach: The Simplex Method for Solving Non-standard Problems is as follows: 1. If necessary, rewrite the problem as a maximization problem (recall that minimizing C is equivalent to maximizing − C ). 2. If necessary, rewrite all constraints (except x ≥ 0 , y ≥ 0 , ⋯ ) using less than or equal to ( ≤ ) inequalities. 3. Introduce slack variables and set up the initial simplex tableau. 4. Select the pivot column: locate the most negative entry to the left of the vertical line in the last row. The column containing this entry is called pivot column (if there is more than one such column choose any one). 5. Scan the upper part of the column of constants of the tableau for negative entries. a. If there are no negative entries, complete the solution using the simplex method for problems in standard form. b. If there are negative entries, proceed to Step 5. 6. a. Pick any negative entry in a row in which a negative entry in the column of constants occurs. The column containing this entry is the pivot column. b. Compute the positive ratios of the numbers in the column of constants to the corresponding numbers in the pivot column (above the last row). The pivot row corresponds to the smallest ratio. The intersection of the pivot column and the pivot row determines the pivot element. c. Pivot the tableau about the pivot element. Then return to Step 5. Calculation: Add slack variables S 1 and S 2 in equations ( 1 ) and ( 2 ) respectively. After introducing these variables Max P = 2 x + 2 y − 4 z + 0 S 1 + 0 S 2 − M A 1 − M A 2 Subject to 3 x + 3 y − 2 z + S 1 + A 1 = 100 5 x + 5 y + 3 z + S 2 + A 2 = 150 And, x , y , z , S 1 , S 2 , A 1 , A 2 ≥ 0 Use the simplex method- Iteration 1 C j 2 2 − 4 0 0 B C B X B x y z S 1 S 1 Min ratio X B B S 1 0 100 3 3 − 2 1 0 33.33 S 1 0 150 5 5 3 0 1 30 P = 0 Z j 0 0 0 0 0 Z j − C j − 2 − 2 4 0 0 The negative minimum Z j − C j = − 2 and its column is first, the variable x will enter and minimum Ratio is 30 so the variable S 2 will depart from basis

Student Solutions Manual for Tan's Finite Mathematics for the Managerial, Life, and Social Sciences, 11th

11th Edition

ISBN: 9781285845722

Author: Tan, Soo T.

Publisher: Cengage Learning

See similar textbooks

Videos

Question

Chapter 4.1, Problem 33E

To determine

To find:

The solution of the linear programming problem.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 4.1, Problem 32E

Chapter 4.1, Problem 34E

Students have asked these similar questions

The graph below shows the U.S. federal expenses for 2012. A) estimate the fraction of the total expenses that were spent on Medicare. Write your answer as the closest fraction whose denominator is 100. B) estimate the fraction of the total expenses that were spent on Medicare and Medicaid. Write your answer as the closest fraction, whose denominator is 100.

Starting with the finished version of Example 6.2, attached, change the decision criterion to "maximize expected utility," using an exponential utility function with risk tolerance $5,000,000. Display certainty equivalents on the tree. a. Keep doubling the risk tolerance until the company's best strategy is the same as with the EMV criterion—continue with development and then market if successful. The risk tolerance must reach $ ____________ before the risk averse company acts the same as the EMV-maximizing company. b. With a risk tolerance of $320,000,000, the company views the optimal strategy as equivalent to receiving a sure $____________ , even though the EMV from the original strategy (with no risk tolerance) is $ ___________ .

2.8.1

Chapter 4 Solutions

Student Solutions Manual for Tan's Finite Mathematics for the Managerial, Life, and Social Sciences, 11th

Ch. 4.1 - Give the three characteristics of a standard...Ch. 4.1 - a. When the initial simplex tableau is set up, how...Ch. 4.1 - In the simplex method, how is a pivoted column...Ch. 4.1 - In Exercises 1-6, a write the linear programming...Ch. 4.1 - In Exercises 1-6, a write the linear programming...Ch. 4.1 - In Exercises 1-6, a write the linear programming...Ch. 4.1 - In Exercises 1-6, a write the linear programming...Ch. 4.1 - In Exercises 1-6, a write the linear programming...Ch. 4.1 - Prob. 6E Ch. 4.1 - In Exercises 7-16, determine whether the given...

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.

The solution of the linear programming problem.

Solution Summary: The author explains the simplex method for solving non-standard problems.

Videos

To find: The solution of the linear programming problem.

Want to see the full answer?

Chapter 4 Solutions

To find:

The solution of the linear programming problem.