Solving linear programing model


Assignment:

Solve the following linear programing model graphically. Maximize Z= 5x1 + 8x2 subject to:

  • 3x1 + 5x2 <= 50
  • 2x1 + 4x2 <= 40
  • x1 <= 8
  • x2 <= 10
  • x1,x2 > 0

Transform this model into standard form and indicate the value of the slack variables at each corner point solution.

Solution Preview :

Prepared by a verified Expert
Mathematics: Solving linear programing model
Reference No:- TGS01895790

Now Priced at $30 (50% Discount)

Recommended (98%)

Rated (4.3/5)