Professional Documents
Culture Documents
Methods of Solving LP
Problems
Two basic solution approaches of linear
programming exist
The graphical Method
simple, but limited to two decision variables
Graphical Method
Construct an x-y coordinate plane/graph
Plot all constraints on the plane/graph
Identify the feasible region dictated by the
constraints
Identify the optimum solution by plotting a
series of objective functions over the feasible
region
Determine the exact solution values of the
decision variables and the objective function
at the optimum solution
Graphical Method
Point
X1
X2
Z = 5X1 +3X2
700
Z = 5 x 0 + 3 x 700 = 2,100
150
700
400
200
400
Z = 5 x 400 + 3 x 0 = 2,000
X1
X2
Z = 400X1 + 200X2
0
Z = 400 x 0+ 200 x 150 = 30,000*
Maximum
150
31.11
80
44.44
X1
X2
Z = 20X1 + 40X2
18
Z = 20 x2 + 40 x 6 = 280
Z = 20 x 4 + 40 x 2 = 160*
Minimum
12
Z = 20 x 12 + 40 x 0 = 240
Z = 20 x 0 + 40 x 18 = 720
Example 4: Solution
Z = 2.80X1 + 2.20X2
Point
X1
X2
40,000
5,000
40,000
10,500
34,500
20,000
6,000
20,000
Example 5: Solution
Point
X1
X2
Z = 10X1 + 8X2
7.5
Z = 10 x 0 + 8 x 7.5 = 60
Z = 10 x 3 + 8 x 9 = 102
Z = 10 x 6 + 8 x 8 = 124*
Maximum
10
Z = 10 x 10 + 8 x 0 = 100
END