Business MathematicsNEB 2081

Solve the following linear programming problem by Simplex method to maximize P = 50x + 60y subject to 3x + 4y 36, 9x + 4y 60, x, y 0

5

Answer

Solution by Simplex Method

Step 1: Convert the inequalities into equations by introducing slack variables and .

The given linear programming problem is: Maximize Subject to:

Step 2: Write the initial simplex tableau.

The objective function is rewritten as: The initial tableau is:

Step 3: Identify the pivot column.

The most negative value in the objective row is , so the pivot column is .

Step 4: Identify the pivot row.

The ratios of the RHS to the pivot column are: The minimum ratio is , so the pivot row is the first row.

Step 5: Perform row operations to make the pivot element 1 and eliminate other entries in the pivot column.

Divide the first row by 4:

Eliminate from the second row and objective row:

The updated tableau is:

Step 6: Check for optimality.

The objective row has no negative values, so the current solution is optimal.

Step 7: Interpret the solution.

The values of the variables are: The maximum value of is 540.


Final Answer:

The maximum value of is 540 when and .

Discussion

Loading…

More Business Mathematics questions

All Business Mathematics old questions