Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
13 views

Solving linear programming problem - Graphical Method

Uploaded by

Duke Amenya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
13 views

Solving linear programming problem - Graphical Method

Uploaded by

Duke Amenya
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Methods for the solution of a linear programming problem

Linear Programming solves the type of problem in which two or more candidates or activities
are competing to utilize the available limited resources, with a view to optimize the
objective function of the problem. The objective may be to maximize the returns or to
minimize the costs. The various methods available to solve the problem are:

1. The Graphical Method when we have two decision variables in the problem. (To deal with
more decision variables by graphical method will become complicated, because we have to deal
with planes instead of straight lines. Hence in graphical method let us limit ourselves to two
variable problems.

2. The Systematic Trial and Error method, where we go on giving various values to variables
until we get optimal solution.

3. The Vector method. In this method each decision variable is considered as a vector and
principles of vector algebra is used to get the optimal solution.

4. The Simplex method. When the problem is having more than two decision variables, simplex
method is the most powerful method to solve the problem. It has a systematic programme, which
can be used to solve the problem.

Graphical Method

In graphical method, the inequalities (structural constraints) are considered to be equations.

Only two variable problems are considered, because we can draw straight lines in two-
dimensional plane (X- axis and Y-axis). More over as we have non-negativity constraint in the
problem (that is, all the decision variables must have positive values always) the solution to the
problem lies in first quadrant of the graph.
The characteristics of Graphical method are:

(i) Generally the method is used to solve the problem, when it involves two decision variables.

(ii) For three or more decision variables, the graph deals with planes and requires high
imagination to identify the solution area.

(iii) Always, the solution to the problem lies in first quadrant.

(iv) This method provides a basis for understanding the other methods of solution.

Problem:

A sweets company manufactures two products, chocolate bars and candy by using three
machines A, B, and C. Machine A has 4 hours of capacity available during the coming week.
Similarly, the available capacity of machines B and C during the coming week is 24 hours and
35 hours respectively. One unit of chocolate bar requires one hour of Machine A, 3 hours of
machine B and 10 hours of machine C. Similarly one unit of candy requires 1 hour, 8 hour and 7
hours of machine A, B and C respectively. When one chocolate bar is sold in the market, it
yields a profit of Ksh. 5/- per product and that of candy is Ksh. 7/- per unit. Solve the problem by
using graphical method to find the optimal product mix.

Let a chocolate bar be X and candy be Y

Machines Products (Time required in hours) Available capacity in hours


X Y
A 1 1 4
B 3 8 24
C 10 7 35
Profit per Unit in Ksh. 5 7
The L.P model is:

Maximise Z = 5x + 7y s.t.
1x + 1y ≤ 4
3x + 8y ≤ 24
10x + 7y ≤ 35 and
Both x and y are ≥ 0.

The inequalities are considered as equations:

Maximise Z = 5x + 7y s.t.
1x + 1y = 4
3x + 8y = 24
10x + 7y = 35 and both x and y are ≥ 0

Generate boundary conditions for machine A, B and C which forms the feasible area for all the
three machines combined.
The area covered by all the three lines PQ. RS, and TU form a closed polygon ROUVW. This
polygon is the feasible area for the three machines. This means that all the points on the lines of
polygon and any point within the polygon satisfies the inequality conditions of all the three
machines.
To find the optimal solution, we have two methods.

Method 1.
Here we find the co-ordinates of corners of the closed polygon ROUVW and substitute the
values in the objective function. In maximisation problem, we select the co-ordinates giving
maximum value. And in minimisation problem, we select the co-ordinates, which gives
minimum value.

In the problem the co-ordinates of the corners are:


R = (0, 3.0), O = (0, 0), U = (3.5,0), V = (2.5, 1.5) and W = (1.6,2.4). Substituting these
values in objective function:
Z( 0,3.0) = 5 × 0 + 7 × 3.0 = Ksh. 21.00, at point R
Z (0,0) = 5 × 0 + 7 × 0 = Ksh. 00.00, at point O
Z(3.5,0) = 5 × 3.5 + 7 × 0 = Ksh. 17.5 at point U
Z (2.5, 1.5) = 5 × 2.5 + 7 × 1.5 = Ksh. 23.00 at point V
Z (1.6, 2.4) = 5 × 1.6 + 7 × 2.4 = Ksh. 24.80 at point W
The optimal solution for the problem is company has to manufacture 1.6 units of product
X and 2.4 units of product Y

Method 2. Isoprofit Line Method:


Isoprofit line is a line on the graph drawn as per the objective function, assuming certain profit.
On this line any point showing the values of x and y will yield same profit. For example in the
given problem, the objective function is Maximise Z = 5x + 7y. If we assume a profit of Ksh.
35/-, to get Ksh. 35, the company has to manufacture either 7 units of X or 5 units of Y. Hence,
we draw line ZZ (preferably dotted line) for 5x + 7y = 35. Then draw parallel line to this line ZZ
at origin. The line at origin indicates zero shillings profit. No company will be willing to earn
zero shillings profit. Hence slowly move this line away from origin. Each movement shows a
certain profit, which is greater than Ksh.0.00. While moving it touches corners of the polygon
showing certain higher profit.
Finally, it touches the farthermost corner covering all the area of the closed polygon. This point
where the line passes (farthermost point) is the OPTIMAL SOLUTION of the problem. Now
point W has co-ordinates (1.6, 2.4).
Now Optimal profit Z = 5 × 1.6 + 7 × 2.4 =Ksh. 24.80.

Points to note:
(i) In case lsoprofit line passes through more than one point, then it means that the problem has
more than one optimal solution, i.e., alternate solutions all giving the same profit. This helps the
manager to take a particular solution depending on the demand position in the market. He has
options.
(ii) If the lsoprofit line passes through single point, it means to say that the problem has unique
solution.
(iii) If the Isoprofit line coincides any one line of the polygon, then all the points on the line are
solutions, yielding the same profit. Hence the problem has innumerable solutions.
(iv) If the line do not pass through any point (in case of open polygons), then the problem do not
have solution, and we say that the problem is UNBOUND.

The objective function of a maximisation is represented by assuming suitable outcome (revenue)


and is known as Isoprofit line. In case of minimisation problem, assuming suitable cost, a line,
known as Isocost line, represents the objective function.

You might also like