Explanation Given: Minimize, w = 4 y 1 + 2 y 2 Subject to, y 1 + 3 y 2 ≥ 6 , 2 y 1 + 8 y 2 ≤ 21 , y 1 ≥ 0 , y 2 ≥ 0 Calculation: Consider the minimization problem which is: Minimize, w = 4 y 1 + 2 y 2 Subject to, y 1 + 3 y 2 ≥ 6 , 2 y 1 + 8 y 2 ≤ 21 , y 1 ≥ 0 , y 2 ≥ 0 Use two stages method in which 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, 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 + 3 y 2 − s 1 = 6 , 2 y 1 + 8 y 2 + s 2 = 21 , where s 1 and s 2 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 + 2 y 2 Subject to, y 1 + 3 y 2 − s 1 = 6 , 2 y 1 + 8 y 2 + s 2 = 21 , y 1 ≥ 0 , y 2 ≥ 0 , s 1 ≥ 0 , s 2 ≥ 0 Convert minimization into maximization which is: z = − w So, Maximize, z = − 4 y 1 − 2 y 2 Subject to, y 1 + 3 y 2 − s 1 = 6 , 2 y 1 + 8 y 2 + s 2 = 21 , y 1 ≥ 0 , y 2 ≥ 0 , s 1 ≥ 0 , s 2 ≥ 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 + 2 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 [ 1 3 − 1 0 6 2 8 0 1 21 4 2 0 0 0 ] Here, the last row shows the coefficients of the objective function and last column shows the constants. The basic variables correspond to columns which have an entry of 1 and rest is zero its value corresponds 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 . Here, y 1 = 0 , y 2 = 0 , s 1 = − 6 , s 2 = 21 In the above simplex, the table has not a basic feasible solution as the basic variable has the negative value. So, first convert basic variables into nonnegative, 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 three linear equations in five variables which is x 1 , x 2 , s 1 , s 2 , 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 1 has negative value, the only non-zero entry in its column is − 1 . In the first row, select any positive entry except the entry which is far from the right, i.e., 0 , 6 . So, take y 1 column as pivot column. Now all the positive entry of pivot column is divided by the last column which is constant: First, 6 ÷ 1 = 6 Second, 21 ÷ 2 = 10.5 After, the row with the smallest quotient is called the pivot row which is 6 . The entry in the pivot row and pivot column is called Pivot

12th Edition

ISBN: 9780134773285

Author: MULLINS

Publisher: YUZU

See similar textbooks

Videos

Question

Chapter 7, Problem 54RE

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 53RE

Chapter 7, Problem 55RE

Students have asked these similar questions

4. (i) Let a be a positive constant and f(x) = ax² e −4x x = R. Find a such that f(x) is a probability density function. [6 Marks] (ii) Let X be a random variable with probability density function in (i) (a) Find (A), the characteristic function of the random variable X. (b) Using (A), calculate E(X) and Var(X). [15 Marks] [14 Marks]

i need help please and thank you

The height of the graph of the probability density function f(x) varies with X as follows (round to four decimal places): X 16 Height of the Graph of the Probability Density Function You are flying out of Terminal 3 at JFK on a Wednesday afternoon between 3:00 and 4:00 PM. You get stuck in a traffic jam on the way to the airport, and if it takes you longer than 12 minutes to clear security, you'll miss your flight. The probability that you'll miss your flight is You have arrived at the airport and have been waiting 10 minutes at the security checkpoint. Recall that if you spend more than 12 minutes clearing security, you will miss your flight. Now what is the probability that you'll miss your flight? ○ 0.5 O 0.25 ○ 0.8333 ○ 0.6667

Chapter 7 Solutions

EBK MATHEMATICS WITH APPLICATIONS IN TH

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.