Explanation Given: The minimization linear programming problem is, Minimize : w = 10 y 1 + 12 y 2 + 10 y 3 subject t o : 5 y 1 + 3 y 2 + 2 y 3 ≤ 150 5 y 1 + 10 y 2 + 3 y 3 ≥ 90 with y 1 ≥ 0 , y 2 ≥ 0 , y 3 ≥ 0 . Method used: Solving a Nonstandard Problem: 1. If necessary, convert the problem to a maximization problem. (If the minimization problem has objective function w , rewrite as a maximization problem with the same constraints and objective function z = − w ). 2. Add slack variables and subtract surplus variables as needed. 3. Write the initial simplex tableau. 4. If any basic variable has a negative value, locate the nonzero number in that variable`s column, and note what row it is in. 5. In the row located in Step 4, find the positive entry that is farthest to the left, and note what column it is in. 6. In the column found in Step 5, choose a pivot by investigating quotients. 7. Use the row operations to change the other numbers in the pivot column to 0. 8. Continue Step 4through 7 until all basic variables are nonnegative. If it never becomes impossible to continue, then the problem has no feasible solution. 9. Once, a feasible solution has been found, continue to use the simplex method until the optimal solution is not found. Calculation: The calculation of y 1 ≥ 0 , y 2 ≥ 0 , and y 3 ≥ 0 using simplex method is as follows. The minimization linear programming problem is, Minimize : w = 10 y 1 + 12 y 2 + 10 y 3 subject t o : 5 y 1 + 3 y 2 + 2 y 3 ≤ 150 5 y 1 + 10 y 2 + 3 y 3 ≥ 90 with y 1 ≥ 0 , y 2 ≥ 0 , y 3 ≥ 0. . Since the given linear programming is of minimization type, change the minimization objective function into maximization by taking z = − w . So, the objective function become, Maximize : z = − 10 y 1 − 12 y 2 − 10 y 3 . Note that the constraints in the maximization problem are same as minimization problem. Thus, the equivalent maximization problem is as follows. Maximize : z = − 10 y 1 − 12 y 2 − 10 y 3 subject t o : 5 y 1 + 3 y 2 + 2 y 3 ≤ 150 5 y 1 + 10 y 2 + 3 y 3 ≥ 90 with y 1 ≥ 0 , y 2 ≥ 0 , y 3 ≥ 0 Note that the above linear programming problem is maximization type. So it is in standard form. Add a slack variable s 1 in first constraint, subtract a surplus variable s 2 in second constraint and rewrite the linear programming problem as follows. Maximize : z = − 10 y 1 − 12 y 2 − 10 y 3 subject t o : 5 y 1 + 3 y 2 + 2 y 3 + s 1 = 150 5 y 1 + 10 y 2 + 3 y 3 − s 2 = 90 with y 1 ≥ 0 , y 2 ≥ 0 , y 3 ≥ 0 , s 1 ≥ 0 , s 2 ≥ 0. (1) The system (1) can be written in the system linear of equation as, 5 y 1 + 3 y 2 + 2 y 3 + s 1 = 150 5 y 1 + 10 y 2 + 3 y 3 − s 2 = 90 10 y 1 + 12 y 2 + 10 y 3 + z = 0 Construct the initial simplex tableau form the above linear system as follows

Finite Mathematics and Calculus with Applications (10th Edition)

10th Edition

ISBN: 9780321979407

Author: Margaret L. Lial, Raymond N. Greenwell, Nathan P. Ritchey

Publisher: PEARSON

See similar textbooks

Videos

Question

Chapter 4.4, Problem 15E

To determine

To find: The value of y1≥0 , y2≥0 and y3≥0 using simplex method.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 4.4, Problem 14E

Chapter 4.4, Problem 16E

Students have asked these similar questions

a -> f(x) = f(x) = [x] show that whether f is continuous function or not(by using theorem) Muslim_maths

Use Green's Theorem to evaluate F. dr, where F = (√+4y, 2x + √√) and C consists of the arc of the curve y = 4x - x² from (0,0) to (4,0) and the line segment from (4,0) to (0,0).

Evaluate F. dr where F(x, y, z) = (2yz cos(xyz), 2xzcos(xyz), 2xy cos(xyz)) and C is the line π 1 1 segment starting at the point (8, ' and ending at the point (3, 2 3'6

Chapter 4 Solutions

Finite Mathematics and Calculus with Applications (10th Edition)

Ch. 4.1 - Prob. 1YT Ch. 4.1 - Prob. 2YT Ch. 4.1 - Prob. 1E Ch. 4.1 - Prob. 2E Ch. 4.1 - Prob. 3E Ch. 4.1 - Convert each inequality into an equation by adding...Ch. 4.1 - For Exercises 58, (a) determine the number of...Ch. 4.1 - Prob. 6E Ch. 4.1 - Prob. 7E Ch. 4.1 - Prob. 8E

Knowledge Booster

$Calculus$

Learn more about

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

The value of y 1 ≥ 0 , y 2 ≥ 0 and y 3 ≥ 0 using simplex method.

Solution Summary: The author explains how to solve the minimization linear programming problem using the simplex method.

Videos

To find: The value of y1≥0 , y2≥0 and y3≥0 using simplex method.

Want to see the full answer?

Chapter 4 Solutions