Explanation Given: Minimize, w = 4 y 1 − 8 y 2 Subject to, y 1 + y 2 ≤ 50 , 2 y 1 − 4 y 2 ≥ 20 , y 1 − y 2 ≤ 22 , y 1 ≥ 0 , y 2 ≥ 0 Calculation: Consider the minimization problem. Minimize, w = 4 y 1 − 8 y 2 Subject to, y 1 + y 2 ≤ 50 , 2 y 1 − 4 y 2 ≥ 20 , y 1 − y 2 ≤ 22 , y 1 ≥ 0 , y 2 ≥ 0 Use two stages method. There are various steps to follow: Step (1): Modify each equation constraint by an equivalent pair of inequality constraint Step (2): Write each constraint with a positive constant. Step (3): If minimization problem, then convert into maximization by replacing z = − w . Step (4): Add or subtract surplus variables according to the need of the constraints into equations. Step (5): Write initial simplex table. Step (6): Find a basic feasible solution if a solution exists, which is stage I. Step (7): If basic feasible solution is found, then do the simplex method further which is a stage and get the optimal solution. Further, to convert linear inequality into the linear equation, then take a slack variable and surplus variable, which is done by adding and subtracting a non-negative variable to each constraint. If linear equality has less than or equal to sign, then use slack variable by adding as the equation is less than or equal to the value if it is equal, then the slack variable is zero. If linear equality has greater than or equal to sign then, use surplus variable by subtracting as the equation is greater than or equal to the value, if it is equal then the surplus variable is zero which is: y 1 + y 2 + s 2 = 50 , 2 y 1 − 4 y 2 − s 2 = 20 , y 1 − y 2 + s 3 = 22 where s 1 , s 2 , s 3 is greater than or equal to zero. Then, rewrite constraints by adding or subtracting the non-negative slack or surplus variables which are: Minimize, w = 4 y 1 − 8 y 2 Subject to, y 1 + y 2 + s 2 = 50 , 2 y 1 − 4 y 2 − s 2 = 20 , y 1 − y 2 + s 3 = 22 y 1 ≥ 0 , y 2 ≥ 0 , s 1 ≥ 0 , s 2 ≥ 0 , s 3 ≥ 0 Convert minimization into maximization which is: z = − w So, Maximize, z = − 4 y 1 + 8 y 2 Subject to, y 1 + y 2 + s 2 = 50 , 2 y 1 − 4 y 2 − s 2 = 20 , y 1 − y 2 + s 3 = 22 y 1 ≥ 0 , y 2 ≥ 0 , s 1 ≥ 0 , s 2 ≥ 0 , s 3 ≥ 0 Then, convert the linear programming into a system of linear equations in which all the coefficient of variables is written on the left of the equal sign and the constants are on the right then convert the objective function into linear equations which are: 4 y 1 − 8 y 2 + z = 0 Then, write the constraint and objective function into the augmented matrix which is in the form of a simplex table: y 1 y 2 s 1 s 2 s 3 [ 1 1 1 0 0 50 2 − 4 0 − 1 0 20 1 − 1 0 0 1 22 4 − 8 0 0 0 0 ] Here, the last row shows the coefficients of the objective function and last columns shows the constants. The basic variables correspond to columns which have an entry of 1 and rest is zero of its value corresponding to the last column which is constant, and the non-basic variables correspond to the other columns and its value is zero. In the above, nonbasic variables are y 1 , y 2 and the basic variables are s 1 , s 2 , s 3 . Here, y 1 = 0 , y 2 = 0 , s 1 = 50 , s 2 = 20 , And, s 3 = 22 Above simplex, the table has not a basic feasible solution as the basic variable has the negative value so first, convert basic variables into non negative then it is said to be basic feasible solution and stage I is completed. In the last row, all the entries except the last and second last entries are called indicators. The simplex table represents a system of four linear equations in six variables, which is x 1 , x 2 , s 1 , s 2 , s 3 , z as there are more variables than equations, then the system is dependent, and it has infinitely many solutions. In the feasible solution as s 2 has negative value, the only non-zero entry in its column is − 1 in the second row select any positive entry except the entry which is far from the right that is 0 , 0 , 1 , 22

Pearson eText for Mathematics with Applications In the Management, Natural, and Social Sciences -- Instant Access (Pearson+)

12th Edition

ISBN: 9780137504381

Author: Margaret Lial, Thomas Hungerford

Publisher: PEARSON+

See similar textbooks

Videos

Question

Chapter 7, Problem 55RE

To determine

To calculate: The mixed constraints problems using two-stage method.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 7, Problem 54RE

Chapter 7, Problem 56RE

Students have asked these similar questions

A boat's value over time, x, is given as the function f(x) = 400(b)x. Which graph shows the boat's value decreasing at a rate of 25% per year?

1. Consider the function f(x) whose graph is given below. Use the graph to determine the following: 2 a) All x for which f'(x) is positive. b) All x for which f'(x) is negative. 2 -2 c) The x for which f'(x) is zero. (please depict this on the graph)

not use ai please

Chapter 7 Solutions

Pearson eText for Mathematics with Applications In the Management, Natural, and Social Sciences -- Instant Access (Pearson+)

Ch. 7.1 - Checkpoint 1 Graph the given...Ch. 7.1 - Prob. 2CP Ch. 7.1 - Prob. 3CP Ch. 7.1 - Prob. 4CP Ch. 7.1 - Prob. 5CP Ch. 7.1 - Checkpoint 6 Graph the feasible region of the...Ch. 7.1 - Prob. 7CP Ch. 7.1 - Match the inequality with its graph, which is one...Ch. 7.1 - Match the inequality with its graph, which is one...Ch. 7.1 - Match the inequality with its graph, which is one...

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.