Scribd
Upload
20 views

LPP Simplex and Graphical

The document provides examples of linear programming problems to be solved using either the simplex method or graphical method. Three problems are presented to be solved using the simplex method, maximizing different objective functions subject to various constraints. Two additional problems are presented to be solved using the graphical method, again maximizing objective functions subject to constraints.

Uploaded by

tidejim315
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
20 views

LPP Simplex and Graphical

The document provides examples of linear programming problems to be solved using either the simplex method or graphical method. Three problems are presented to be solved using the simplex method, maximizing different objective functions subject to various constraints. Two additional problems are presented to be solved using the graphical method, again maximizing objective functions subject to constraints.

Uploaded by

tidejim315
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Simplex Method

Simplex Method
Solve the following LP problem using simplex method
Max Z = 3X1 + 2X2 + 5X3
Subject to constraints

X1 + 2X2 + X3 ≤ 430
3X1 + 2X3 ≤ 460
X1 + 4X3 ≤ 420
Where X1, X2, X3 ≥ 0
Simplex method

Solve the following LP problem using simplex method


Max Z = X1 – 3X2 + 2X3
Subject to constraints

3X1 – X2 + 3X3 ≤ 7
-2X1 + 4X2 ≤ 12
-4X1 + 3X2 + 8X3 ≤ 10

Where X1, X2, X3 ≥ 0


Simplex method
Solve the following LP problem using simplex method
Max Z = 4X1 + 10X2

Subject to constraints

2X1 + X2 ≤ 50
2X1 + 5X2 ≤ 100
2X1 + 3X2 ≤ 90

Where X1, X2 ≥ 0
Graphical method
Graphical method
Use the graphical method to solve the following
LP problem
Graphical method

Use the graphical method to solve the following LP problem

Max Z = 3X1 + 5X2


Subject to constraints

X1 + X2 ≥ 100
5X1 + 10X2 ≤ 400
6X1 + 8X2 ≤ 440

Where X1, X2 ≥ 0
Graphical method
Graphical method

Use the graphical method to solve the following LP problem

Max Z = 3X1 + 2X2

Subject to constraints

-2X1 + 3X2 ≤ 9
X1 – 5X2 ≥ -20

Where X1, X2 ≥ 0

You might also like