Linear Programming (Graphical Method)

Linear programming problems with two decision variables can be easily solved by graphical method.

Feasible Region It is the collection of all feasible solutions. In the following figure, the shaded area represents the feasible region.

8/2/12

Convex Set It is a collection of points such that for any two points on the set, the line joining the points belongs to the set. In the following figure, the line joining P and Q belongs entirely in R. Thus, the collection of feasible solutions in a linear programming problem form a convex set.

8/2/12

Extreme Point Extreme points are referred to as vertices or corner points. In the following figure, P, Q, R and S are extreme points.

8/2/12

Steps for Graphical Methods Formulate the mathematical model of the given linear programming problem. Treat inequalities as equalities and then draw the lines corresponding to each equation and non-negativity restrictions. Locate the end points (corner points) on the feasible region. Determine the value of the objective function corresponding to the end points determined in step 3. Find out the optimal value of the objective function.
8/2/12

1.

1.

1.

1.

1.

Problem
A factory produces two types of raw mortar i.e. lean mix mortar and rich mix mortar. Two basic materials, Cement and Sand are used to produce the mixes. The maximum availability of cement is 800 cu.ft a day; that of sand is 3000 cu.ft a day. The requirement of cement and sand per cu.ft of rich and lean mix is given as under:

Price in Rs. / (cu.ft) Cement (cu. ft) Sand (cu.ft)

Rich Mix 500 0.3 1.0

Lean Mix 300 0.2 1.0

A market survey has established that the daily demand for the lean mix does not exceed that of rich mix by more than 1000 cu.ft. The maximum demand for lean mix is limited to 1200 cu.ft 8/2/12

Decision Variables
1.

Rich Mix produced daily = x1 Lean Mix produced daily = x2

1.

Objective Function Z = 500 x1 + 300 x2

Constraints 0.3 x1 + 0.2x2 800 (Cement) x1 + x2 3000 (Sand) x2 x1 1000 ( relative diff. of lean and rich) 8/2/12

. . .

Constraint Equations
5000 5000 4000 4000 3000 3000 2000 1000 0 0 1000 2000 3000 4000 5000 0 0 1000 2000 3000 4000 5000

0.3x1 +0.2 x2 800

x 2000 2
1000

5000 4000 3000 2000 1000 0 0 1000 2000 3000 4000 5000 5000 4000 3000 2000 1000 0 0 1000

x 1

8/2/12

2000

3000

4000

5000

x 1

Constraint Equations

x 2

8/2/12

x 1

B x 2 A

Z = 500 x1 + 300 x2 C D

500

-300

O
Z-Line

x 1

Lines for different values of Z are drawn parallel to Z line passing through origin O which has been 8/2/12 constructed by equating

For different values of decission variables, the values obtained for Z are given in following table. Z = 500 x1 + 300 x2 = 0, giving x1/x2 = -300 x1 x2 Z Corner / 500
Origin A B C D E

0 0 150 1800 2000 2667

0 1000 1200 1200 1000 0

0 300000 435000 1260000 1300000 1333500

8/2/12