Scribd
Upload
22 views

Linear Programming The Graphical Method

Uploaded by

Praduman Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
22 views

Linear Programming The Graphical Method

Uploaded by

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

2

3
4
5
6
7
LP Problem Solution

Extreme Point Solution Method


Fig. 3 Graphical Solution of LP Problem -2

Example 2: Use the graphical method to solve the following LP problem.

Maximize Z = 2x1 + x2
subject to the constraints
x1 + 2x2 £ 10
x1 + x2 £ 6
x1 – x2 £ 2
x1 – 2x2 £ 1
and x1 , x2 £ 0
23
LP Problem Solution

Extreme Point Solution Method


Fig. 4 Graphical Solution of LP Problem -3

Example 3: Use the graphical method to solve the LP problem.


Minimize Z = 3x1 + 2x2

subject to the constraints


5x1 + x2 ³ 10

x1 + x2 ³ 6

x1 + 4x2 ³ 12

and x1, x2 ³ 0

25
LP Problem Solution

Extreme Point Solution Method

Fig. 5 Graphical Solution of LP Problem -4

Example 4: Use the graphical method to solve the LP problem.

Minimize Z = – x1 + 2x2
subject to the constraints

– x1 + 3x2 £ 10

x1 + x2 £ 6

x1 – x2 £ 2

and x1 , x2 ³ 0.

© Macmillan Publishers India Ltd 1997,200 27


3,2007,2009
LP Problem Solution

Extreme Point Solution Method


Fig. 6 Graphical Solution of LP Problem -5

Example 5: Use the graphical method to solve the LP problem.


Maximize Z = 2x1 + 3x2
subject to the constraints
x1 + x2 £ 30
x2 ³ 3
0 £ x2 £ 12
0 £ x1 £ 20
x1 – x2 ³ 0
and x1, x2 ³ 0

© Macmillan Publishers India Ltd 1997,200 29


3,2007,2009
LP Problem Solution

Extreme Point Solution Method

Extreme Point Coordinates Objective Function Value


(x1, x2) Z = 2x1 + 3x2

A (3, 3) 2(3) + 3(3) = 15


B (20, 3) 2(20) + 3(3) = 49
C (20, 10) 2(20) + 3(10) = 70
D (18, 12) 2(18) + 3(12) = 72
E (12, 12) 2(12) + 3(12) = 60

The maximum value of the objective function Z = 72 occurs at the extreme point
D (18,12). Hence, the optimal solution to the given LP problem is: x1 = 18, x2 = 12
and Max Z = 72 © Macmillan Publishers India Ltd 1997,200 30
3,2007,2009
LP Problem Solution

Extreme Point Solution Method

Example 6: A firm makes two products X and Y, and has a total production
capacity of 9 tones per day, X and Y requiring the same production capacity. The
firm has a permanent contract to supply at least 2 tones of X and at least 3 tones
of Y per day to another company. Each tone of X requires 20 machine hours of
production time and each tone of Y requires 50 machine hours of production time.
The daily maximum possible number of machine hours is 360. All the firm’s
output can be sold, and the profit made is Rs. 80 per tone of X and Rs. 120 per
tone of Y. It is required to determine the production schedule for maximum profit
and to calculate this profit.

© Macmillan Publishers India Ltd 1997,200 31


3,2007,2009
LP Problem Solution

Extreme Point Solution Method

Extreme Point Coordinates Objective Function Value


(x1, x2) Z = 80x1 + 120x2

A (2, 3) 80(2) + 120(3) = 520


B (6, 3) 80(6) + 120(3) = 840
C (3, 6) 80(3) + 120(6) = 960
D (2, 6.4) 80(2) + 120(6.4) = 928
The maximum value of the objective function Z = 960 occurs at the extreme
point C (3, 6). Hence the company should produce, x1 = 3 tones of product X

and x2 = 6 tones of product Y in order to yield a maximum profit of Rs. 960.

© Macmillan Publishers India Ltd


1997,2003,2007,2009 32
LP Problem Solution

Extreme Point Solution Method

Fig. 7 Graphical Solution of LP Problem -6

© Macmillan Publishers India Ltd 1997,200 33


3,2007,2009
LP Problem Solution

Extreme Point Solution Method

Example 7: A manufacturer produces two different models: X and Y, of the same


product. Model X makes a contribution of Rs 50 per unit and model Y, Rs 30 per
unit towards total profit. Raw materials r1 and r2 are required for production. At

least 18 kg of r1 and 12 kg of r2 must be used daily. Also at most 34 hours of


labour are to be utilized.

A quantity of 2 kg of r1 is needed for model X and 1 kg of r1 for model Y. For

each of X and Y, 1 kg of r2 is required. It takes 3 hours to manufacture model X


and 2 hours to manufacture model Y. How many units of each model should be
produced to maximize the profit?

© Macmillan Publishers India Ltd 1997,200 34


3,2007,2009
LP Problem Solution

Extreme Point Solution Method


Fig. 8 Graphical Solution of LP Problem - 7

© Macmillan Publishers India Ltd 1997,200 35


3,2007,2009
LP Problem Solution

Extreme Point Solution Method

Extreme Point Coordinates Objective Function Value


(x1, x2) Z = 50x1 + 30x2

A (6, 6) 50(6) + 30(6) = 480


B (2, 14) 50(2) + 30(14) = 520
C (10, 2) 50(10) + 30(2) = 560

Since the maximum value of Z = 560 occurs at the point C (10, 2), the
manufacturer should produce x1 = 10 units of model X and x2 = 2 units of Y to
yield a maximum profit of Rs. 560.

© Macmillan Publishers India Ltd 1997,200 36


3,2007,2009

You might also like