Explore BrainMass
Share

Mathematics - Finite Mathematics

Please show all work.

Use the Simplex Method to solve the following linear programming problem. Show all tableaus and make a notation of all row operations performed.
Maximize:
P = 2x1 + 8x2 + 10x3 + x4
subject to the constraints
x1 + 2x2 + x3 + x4 <= 50
3x1 + x2 + 2x3 + x4 <= 100

x1 >=0 x2 >= 0 x3 >= 0 x4 >= 0

(Please see the attached file)

© BrainMass Inc. brainmass.com June 24, 2018, 1:03 pm ad1c9bdddf

Attachments

Solution Summary

The expert examines the finite mathematics. A complete, neat and step-by-step solution is provided in the attached file.

$2.19