Explanation Given information: The objective function which has to maximize is: M = 2 x + 3 y which is subjected to the constraints: { x + 2 y ≤ 14 x + y ≤ 9 3 x + 2 y ≤ 24 x ≥ 0 y ≥ 0 Formula used: The maximization problem of simplex can be solved as below: Step 1: Write the initial tableau and find the feasible solution. Step 2: Find the pivot column, by finding maximum negative number in the last row of the tableau. Step 3: Now divide the all elements which are in the last column by their corresponding elements of pivot column to decide pivot elements. Step 4: Now to make the pivot element unity, divide all the element of pivot row by 1 and make all other elements of pivot column to zero by row operation. Step 5: If there is one or more than one negative number in the last row, then the above tableau is not optimal, it needs iteration. Calculation: Write the provided constraints in the form of linear equations by introducing slack variables, u , v and w which are: x + 2 y + u = 14 x + y + v = 9 3 x + 2 y + w = 24 − 2 x − 3 y + M = 0 Step 1: Write the initial tableau and find the feasible solution. In the matrix form it can be written as: x y u v w M [ 1 2 1 0 0 0 14 1 1 0 1 0 0 9 3 2 0 0 1 0 24 − 2 − 3 0 0 0 1 0 ] So, the above simplex tableau is initial tableau, therefore one feasible solution is: x = 0 , y = 0 , u = 14 , v = 9 , w = 24 and M = 0 Step 2: Find the pivot column, by finding maximum negative number in the last row of the tableau. From the above table it can be observed that in the last row the maximum negative number is − 3 so the 2 nd column is pivot column. Step 3: Now divide the all elements which are in the last column by their corresponding elements of pivot column to decide pivot elements. x y u v w M u v w M [ 1 2 1 0 0 0 14 1 1 0 1 0 0 9 3 2 0 0 1 0 24 − 2 − 3 0 0 0 1 0 ] 14 2 = 7 9 1 = 9 24 2 = 12 It can be observed that the minimum positive ratio is 7 which is 1 st row, therefore the pivot element is 1 st row and 2 nd column, which is 2. Step 4: Now to make the pivot element unity, divide all the element of pivot row by 2 and make all other elements of pivot column to zero by row operation which is as below: x y u v w M [ 1 2 1 1 2 0 0 0 7 1 1 0 1 0 0 9 3 2 0 0 1 0 24 − 2 − 3 0 0 0 1 0 ] R 2 − 1 × R 1 R 3 − 2 × R 1 R 4 + 3 × R 1 → [ 1 2 1 1 2 0 0 0 7 1 2 0 − 1 2 1 0 0 2 2 0 − 1 0 1 0 10 − 1 2 0 3 2 0 0 1 21 ] So, the next tableau for pivot 2 is: y v w M [ 1 2 1 1 2 0 0 0 7 1 2 0 − 1 2 1 0 0 2 2 0 − 1 0 1 0 10 − 1 2 0 3 2 0 0 1 21 ] The feasible solution for this tableau is: y = 7 , v = 2 , w = 10 and M = 21

12th Edition

ISBN: 9780134464053

Author: HAIR

Publisher: YUZU

See similar textbooks

Videos

Question

Chapter 4, Problem 3RE

To determine

To calculate: The maximum value of objective function: M=2x+3y which is subjected to the constraints:

{x+2y≤14x+y≤93x+2y≤24x≥0y≥0

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 4, Problem 2RE

Chapter 4, Problem 4RE

Students have asked these similar questions

by (2) Gauss saidel - - method find (2) و X2 for the sestem X1 + 2x2=-4 2x1 + 2x2 = 1 Such thef (0) x2=-2

Can you please explain how to find the bounds of the integrals for X and Y and also explain how to find the inequalites that satisfy X and Y. I've looked at the solutions but its not clear to me on how the inequalities and bounds of the integral were obtained. If possible could you explain how to find the bounds of the integrals by sketching a graph with the region of integration. Thanks

ax+b proof that se = - è (e" -1)" ë nax

Chapter 4 Solutions

EBK FINITE MATHEMATICS & ITS APPLICATIO

Ch. 4.1 - 1. Determine by inspection a particular solution...Ch. 4.1 - Prob. 2CYU Ch. 4.1 - For each of the following linear programming...Ch. 4.1 - For each of the following linear programming...Ch. 4.1 - For each of the following linear programming...Ch. 4.1 - For each of the following linear programming...Ch. 4.1 - For each of the following linear programming...Ch. 4.1 - For each of the following linear programming...Ch. 4.1 - 712For each of the linear programming problems in...Ch. 4.1 - 7–12 For each of the linear programming problems...

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 maximum value of objective function: M = 2 x + 3 y which is subjected to the constraints: { x + 2 y ≤ 14 x + y ≤ 9 3 x + 2 y ≤ 24 x ≥ 0 y ≥ 0

Solution Summary: The author explains how the maximization problem of simplex can be solved by writing the initial tableau and finding the feasible solution.

Videos

To calculate: The maximum value of objective function: M=2x+3y which is subjected to the constraints:

{x+2y≤14x+y≤93x+2y≤24x≥0y≥0

Want to see the full answer?

Chapter 4 Solutions

The maximum value of objective function: M = 2 x + 3 y which is subjected to the constraints: { x + 2 y ≤ 14 x + y ≤ 9 3 x + 2 y ≤ 24 x ≥ 0 y ≥ 0

Solution Summary: The author explains how the maximization problem of simplex can be solved by writing the initial tableau and finding the feasible solution.

Videos

To calculate: The maximum value of objective function: M=2x+3y which is subjected to the constraints: {x+2y≤14x+y≤93x+2y≤24x≥0y≥0

Want to see the full answer?

Chapter 4 Solutions

To calculate: The maximum value of objective function: M=2x+3y which is subjected to the constraints:

{x+2y≤14x+y≤93x+2y≤24x≥0y≥0