Question: Solve the following lincar program using the simplex algorithm. Maximize z = 4 x+ 2x2-2 X Subject to 3x +6x2-3x3 90 3x+ x2+ x 180

Solve the following lincar program using the simplex algorithm.

Maximize z = 4 x+ 2x2-2 X Subject to 3x +6x2-3x3≤ 90 3x₁+ x2+ x≤ 180 X- x2+ xy=60 Allx's 20

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Operations And Supply Chain Management The Core Questions!