Explanation Given Information: The linear programing problem with mixed constraint is given as: Maximize f = 3 x + 2 y subject to − x + 2 y ≤ 20 − 3 x + 2 y ≤ − 36 x + y ≤ 22 Formula used: To solve the linear programming problem by simplex method, follow the steps below: Step 1: Use slack variables and write the constraint inequalities in equation form. Step 2: Write the equations in a simplex matrix. Step 3: Choose the most negative number on the left side of the bottom row and pivot the column. Step 4: Select the pivot entry which is the smallest of the test ratios a b , where, a is entry in the right most column and b is the corresponding entry in the pivot column. Step 5: Make the pivot entry as 1 and other entries of pivot column as 0 by the use of row operations. Step 6: Repeat the above steps till all the entries in the bottom row are non-negative. Calculation: Provided the LPP is, Maximize f = 3 x + 2 y subject to the constraints − x + 2 y ≤ 20 − 3 x + 2 y ≤ − 36 x + y ≤ 22 Since, above maximization problem has mixed constraint so first convert all the constraints into standard form. Express all constraints as ≤ constraints. To form the simplex form convert all the inequalities into equations, add slack variable into the inequalities. − x + 2 y + s 1 = 20 − 3 x + 2 y + s 2 = − 36 x + y + s 3 = 22 x ≥ 0 , y ≥ 0 Where s 1 , s 2 and s 3 are two slack variables with s 1 , s 2 , s 3 ≥ 0 . Simplex matrix for the LPP is written below: x y s 1 s 2 s 3 f [ − 1 2 1 0 0 0 20 − 3 2 0 1 0 0 − 36 1 1 0 0 1 0 22 − 3 − 2 0 0 0 1 0 ] Since ( − 3 ) is the most negative entry therefore 2 nd column is pivot column and ratio is minimum in first row corresponding to element ( − 3 ) , hence ( − 3 ) is pivot element for this table. Solve the given problem by simplex method. Apply the row operations to solve this matrix: − 1 3 R 2 → R 2 R 2 + R 1 → R 1 − R 2 + R 3 → R 3 3 R 2 + R 4 → R 4 The matrix will become: x y s 1 s 2 s 3 f [ 0 4 3 1 − 1 3 0 0 32 1 − 2 3 − 1 − 1 3 0 0 12 0 5 3 1 1 3 1 0 10 0 − 4 0 − 1 0 1 36 ] As − 4 is the most negative entry, the first column is the pivot column and 5 3 in the row 3 is pivot entry

Mathematical Applications for the Management, Life, and Social Sciences

12th Edition

ISBN: 9781337625340

Author: Ronald J. Harshbarger, James J. Reynolds

Publisher: Cengage Learning

See similar textbooks

Videos

Question

Chapter 4.5, Problem 18E

To determine

To calculate: The optimal solution of the LPP with the help of simplex method.

Maximize f=3x+2y subject to

−x+2y≤20−3x+2y≤−36x+y≤22

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 4.5, Problem 17E

Chapter 4.5, Problem 19E

Students have asked these similar questions

A company produces two types of solar panels, A and B, that sell for $5 million and $4 million per thousand units, respectively. The cost of producing x thousand of type A and y thousand of type B is x - 3xy + 6y + 16x - 65y - 5. Find the values of x and y that maximize the company's profits. [Note: Profit = (revenue) – (cost).] The company will achieve a maximum profit by selling solar panels of type A and selling solar panels of type B.

Maximize z = 10x₁ + 55x2 + 50x3, subject to 4x₂ + 9x3 ≤ 122 13x2 + 22x3 S 142 6x215x3 S 245 ≥ 0, X3 2 0. X3 $1 16x1 X1 - 8X₁ + 5X1+ x1 ≥ 0, X₂ X2 $2 $3 N

Use the simplex method to solve the linear programming problem. x₂ = (Type integers or simplified fractions.) B. There is no maximum. Maximize subject to: ,S₁ = with z = 10x₁ +21x₂ 9x₁ + 3x₂ 542 Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. OA. The maximum is when x₁ = S₂ = 6x₁ + x₂ ≤50 3x₁ + 3x₂ 545 x₁ 20, x₂ 20 and $3=

Chapter 4 Solutions

Mathematical Applications for the Management, Life, and Social Sciences

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 optimal solution of the LPP with the help of simplex method. Maximize f = 3 x + 2 y subject to − x + 2 y ≤ 20 − 3 x + 2 y ≤ − 36 x + y ≤ 22

Solution Summary: The author calculates the optimal solution of the linear programming problem with the help of simplex method.

Videos

To calculate: The optimal solution of the LPP with the help of simplex method.

Maximize f=3x+2y subject to

−x+2y≤20−3x+2y≤−36x+y≤22

Want to see the full answer?

Chapter 4 Solutions

The optimal solution of the LPP with the help of simplex method. Maximize f = 3 x + 2 y subject to − x + 2 y ≤ 20 − 3 x + 2 y ≤ − 36 x + y ≤ 22

Solution Summary: The author calculates the optimal solution of the linear programming problem with the help of simplex method.

Videos

To calculate: The optimal solution of the LPP with the help of simplex method. Maximize f=3x+2y subject to −x+2y≤20−3x+2y≤−36x+y≤22

Want to see the full answer?

Chapter 4 Solutions

To calculate: The optimal solution of the LPP with the help of simplex method.

Maximize f=3x+2y subject to

−x+2y≤20−3x+2y≤−36x+y≤22