Linear programming problem with graphical method

Formulation of Linear Programming problem

The formulation of linear programming problem as a mathematical model involves the following
basic steps:

⮚ 1: find the key decision to be made from the study of the problem.
⮚ 2: Identify the variable and assign symbols x1, x2, x3……., for variable quantities noticed
in step 1.
⮚ 3: state the feasible alternatives which generally in a given situation is:
o {(x1, x2) | x1>_0, x2 >_ 0}
⮚ 4: Identify the constraints or restrictions in the problem and express them as linear
equations or inequalities which are linear functions of the unknown variables.
⮚ 5: Identify the objective which is to be optimized and represent it as a linear function in
terms of unknown variables.

Problem 2.1

A firm makes two types of furniture chairs and tables. The contribution for each product as
calculated by the accounting department is Rs. 20 per chair and Rs. 30 per table. Both products
are processed on three machines M1 ,M2 and M3. The time required (in hours) by each product
and total time available per week on each machine are as follows:

Machine Chair Table Available hours

per week
M1 3 3 36
M2 5 2 50
M3 2 6 60

How should the manufacturer schedule his production in order to maximize contribution ?
Formulate the problem as a linear programming problem.
Formulation Method

Step 01: Study the situation to find the key decision to be made. Here the key decision to be
made is to determine the number of chairs and tables to maximize the profit.

Step 02 : Identify the decision variables

Let us consider,

X1 = Number of chair produced

X2 = Number of table produced

Step03: State the feasible alternative.

X1≥0 , X2≥0

Step 04: Express the constraints in term of the variables.

X1X2
H1

H2 ≤
H3

Subject to constraints,

3x1+3x2≤36
5x1+2x2≤50
2x1 + 6x2≤ 60

Problem: The objective quantitatively in terms of the variables the profit function,

The profit function,

Zmax = 20x1 +30x2

 Subject to constraints,

3x1 + 3x2 ≤ 36
5x1 + 2x2 ≤ 50
2x1 + 6x2 ≤ 60
X1≥0 , X2≥0

Solution: Graphical Solution Method

Z = 20x1 + 30x2

3x1 + 3x2 ≤ 36 _ _ _ _ _ ( i )
5x1 + 2x2 ≤ 50 _ _ _ _ _ ( ii )
2x1 + 6x2 ≤ 60 _ _ _ _ _ ( iii )

X1≥0 ; X2≥0

From equation ( i )

3x1 + 3x2 = 36

X1 12 0
X2 0 12
(12, 0) (0 , 12)

From equation ( ii )

5x1 + 2x2 = 50

X1 10 0
X2 0 25
(10, 0) (0 , 25)
From equation ( iii )

2x1 + 6x2 = 60

X1 30 0
X2 0 10
(30, 0) (0 , 10)
Extreme Point Coordinate point Objective function
(X1 , X2) Z = 20x1 + 30x2
A ( 10 , 0 ) Z = 20x10 + 30x0 = 200
B (9,3) Z = 20x9 + 30x3 = 270
C ( 3, 9) Z = 20x3 + 30x9 = 330
D ( 0, 10 ) Z = 20x0 + 30x10 = 300

So, by graphical method, the maximum point is at C (3, 9) and the maximum value is 330 (In
order to maximize contribution, the manufacture should schedule/produce 3chairs and 9tables)

Problem 2.2

A firm manufactures two products, each of which must be produced through two departments, 1
and 2. The hourly requirements per unit for each product in each department, the weekly
capacities in each department, selling price per unit, labor cost per unit and raw material cost per
unit are summarized as follows :

Product A Product B Weekly capacities

Department 1 3 2 120
Department 2 4 6 260
 Selling price (per unit) Rs. 25 Rs. 30
Labor cost (per unit) Rs. 16 Rs. 20
Raw material cost per unit Rs. 4 Rs. 4
The problem is to determine the number of units to be produced of each product so as to
maximize total contribution to profit. Formulate the problem as a linear programming problem.

Formulation Method

Step 01 : Study the situation to find the key decision to be made. Here the key decision to be
made is to determine the number of products to maximize the profit while satisfying the given
constraints of supply and production.

Step 02 : Identify the decision variables

Let us consider,

X1 = Number of product A produced

X2 = Number of product B produced

Step 03:State the feasible alternative.

X1≥0 , X2≥0

Step 04: Express the constraints in term of the variables.

X1 X2
D1

≤
D2

Subject to constraints,

3x1 + 2x2 ≤ 120

4x1 + 6x2 ≤ 260

Step 05:Express the objective quantitatively in terms of the variables the profit function,

Profit of product A = 25 - (16+4)

=5
 Profit of product B = 30 - (20+4)
=6

The cost function,

Zmax = 5x1 + 6x2

Subject to constraints,

3x1 + 2x2 ≤ 120

4x1 + 6x2 ≤ 260

X1≥0 , X2≥0

Problem 2.3

The manager of an oil refinery must decide on the optimum mix of two possible blending
processes of which the inputs and outputs per production run are as follows :

Process Input (units) Output (units)

Crude A Crude B Gasoline X Gasoline Y
1 5 3 5 8
2 4 5 4 4

The maximum amount available of crudes A and B is 200 units and 150 units respectively.
Market requirement show that at least 100 units of gasoline X and 80 units of gasoline Y must be
produced. The profits per production run from process 1 and process 2 are Rs. 300 and Rs. 400
respectively. Solve the L. P. problem by graphical method.

Graphical Solution Method

Z = 300x1 + 400x2
 5x1 + 4x2 ≤ 200 _ _ _ _ _ ( i )
5x1 + 4x2 ≥ 100 _ _ _ _ _ ( ii )
3x1 + 5x2 ≤ 150 _ _ _ _ _ ( iii )
8x1 + 4x2 ≥ 80 _ _ _ _ _ ( iv )
X1≥0 , X2≥0

From equation ( i )

5x1 + 4x2 = 200

X1 40 0
X2 0 50
(40, 0) (0 , 50)

From equation ( ii )

5x1 + 4x2 = 100

X1 20 0
X2 0 25
(20, 0) (0, 25)

From equation ( iii )

3x1 + 5x2 = 150

X1 50 0
X2 0 30
(50, 0) (0, 30)

From equation ( vi )

8x1 + 4x2 = 80

X1 10 0
X2 0 20
(10, 0) (0 , 20)
Extreme Point Coordinate point Objective function
(X1 , X2) Z = 300x1 + 400x2
A ( 20 , 0 ) Z = 300x20 + 400x0 = 6000
B ( 40 , 0 ) Z = 300x40 + 400x0 = 12000
C ( 31 , 12 ) Z = 300x31 + 400x12 = 14100
D ( 0, 30 ) Z = 300x0 + 400x30 = 12000

Problem: Using graphic method, find the maximum value of Z=7X1 + 10X2

X1+X2 ≤ 30000
X2≤ 12000
X1≥6000
X1 ≥X2
X1≥≥ 0
X2≥ 0

Solution: Z max= 7X1+10X2

X1+X2 ≤ 30000
X2≤ 12000
X1≥6000
X1 ≥X2
X1≥≥ 0
X2≥ 0
From equation---------- (i)

X1+X2=30000

(30000, 0) (0, 30000)

X1 30000 0

X2 0 30000

From equation --------- (ii)

X2 =12000

=> 0X1=X2 =12000

=> X2=12000

(12000, 0)

From equation --------- (iii)

X1=6000

=>X=0->X2=6000

(6000, 0)

From ---------------- (iv)

X1=X2

The shaded portion in graph represents feasible region. The corner points of the feasible region
are A (6000, 0), B (30000, 0), C (18000, 120000), D (12000, 12000) and E (6000, 6000).
Thus the maximum value of Z is 2, 46,000 and it occurs when X1=18000 and X2=12000.
Extreme point Coordinate Objective function value
(X1+X2) Z= 7x1+ 10x2
A (6000,0) 7(6000)+0=42,000
B (30000,0) 7(30000)+0=2,10,000
C (18000,12000) 7(18000)+10(12000)=2,46,000
D (12000, 12000) 7(12000)+10(12000)=2,04,000
E (6000,6000) 7(6000)+(6000)=1,02,000