0 ratings0% found this document useful (0 votes) 588 views47 pagesChapter 2 (Part 1) Linear Programming (Formulation & Graphical Method)
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content,
claim it here.
Available Formats
Download as PDF or read online on Scribd
Chapter 2
LINEAR PROGRAMMING
(ForMuLATION AND GRAPHICAL Metnop)
Se
Gi Intropuction
Linear programming isa technique to determine optimal allocation of limited resources to
meet the given objectives. The resources may be in the form of men, materials and machines,
etc. and the objective may be to maximise or minimise a given funetion. There are certain
restrictions on the total amount of each resource available, and on the quallty of each product
made. Out of all permissible allocations of resources, one has to find the one which optimises
(maximise or minimise) the total profit or cost. This technique was first used by an American
‘economist George B. Dantzig in 1947.
Meaning
Linear programming consists of two words, ‘near’ and ‘programming’. The term Tincar’
I the relations among the variable in the particular problem are linear (Le., of
jotted graphically. The term ‘programing’ refers
linear
implies that al
degree one) and given straight lines when pl
fo the procedure of determining a mathematical programme or plan of action. Thus,
programming is a mathematical technique for the analysis of optimum decisions subject
eemvanatraints in the form of linear inequalities. In other words, linear programming is a
1. sthematical method which appliesto those problems which require the solution of maximisation
‘nimisation problem subject to linear inequalities in terms of certain variables.
or mi
Cy Derinrrion
inalysis of problems in which a linear function of a number of variable is
zy be maximised (or minimised) when those variables are subject to a numberof constraints inthe form
of linear inequalities.” —R. Dorfman, P. Samuelson and R. Solow
“Linear programming is the simpler variety of programming problem in which the objective Junction as
swell asthe constraint inequalities are all linear Alpha C. Chiang
ing is a technique for the formulation and analysis of constrained optimisation
“Linear programming is thea
“Linear programm
vm in which the objective function is a linear function, and isto be maximise or minimise subject
piv number of linear inequality constraints.” David W. Pearce
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) uw
© Basic Concepts oF LINEAR PROGRAMMING
Objective Function
An objective function of a linear programming problem states the determinants of the
quantity to be maximised or to be minimised. Profits or revenues are objective functions when
they are to be maximised and cost is objective function when it is to be minimised. An objective
function has parts: (i) the primal or original problem, and (ii) dual problem. If the primal of
the objective function is to maximise revenue, then its dual will be the minimisation of costs and
vice-versa.
© Constraints
‘There must be certain constraints or restrictions on the variable of the function of the
problem. Constraints are the limitations or bounds imposed on the solution, which are expressed
in the form of inequalities
Non-Negativity Restrictions
The decision variables must notassume negative values which represent impossible situation.
Non-negativity restrictions are those which assume that there cannot be negative values of the
variables involved in the study of linear programming problem. Thus all variables must take on
values equal to or greater than zero.
Feasible Region,
The region which is common to all the constraints of a linear programming problem is called
the feasible region of the given problem. In other words, the graph of the system of linear in
equations, comprising of constraints of the problem is the feasible region of the given problem.
Feasible Solution
A feasible solution to a linear programming problem is the set of values of the variables
which satisfies the set of constraints and the non-negative restrictions of the problem.
Optimum Solution
‘A feasible solution that satisfies both the conditions of the problem and also optimise the
objective function of the problem is called optimum solution. The optimal solution is the best of
the feasible solutions.
CO Assumptions oF LINEAR PROGRAMMING
The following four assumptions are necessary for all linear programming problem:
1. Linearity: All relationship in LPP, ie, in both objective function and constraints are
assumed to be linear. They are represented by straight lines.
Seanned wiek CamScanner12
Operations Research
ditivity: The value of the objective function for the given values of the deci
variables and total sum of resources used must be equal to the sum of the contributions:
(profits or costs) earned from each decision variable.
3. Divisibility: Divisibility simply means that the solution need not to be in whole numbers
(integers). Instead they are divisible and may take fractional value.
4. Certainty: This assumption means that all parameters are known with certainty and do
not change during the period being studied.
Non-negative Variable: In LP problems, we assume that all variables are non-negative.
Negative values of physical quantities are an impossible situation
© Business Appuications oF LINEAR PROGRAMMING
Linear programming is a technique of decision making mostly used in business, industry
and in various other fields. Some of the applications of linear programming are as follows:
( Diet Problems: To determine the minimum requirement of nutrients subject to
availability of foods and their prices.
(éi) Manufacturing Problems: To find the number of items of each type that should be
manufactured so as to maximise the profit subject to production restrictions imposed by
limitations on the use of machinery and labour.
(iii) Transportation Problems: To find the least costly way of transporting shipments from
the warehouses to customers.
(iv) Blending Problems: To determine the optimum amount of several constituents to use
in producing a sct of products while determining the optimum quantity of each product
to produce.
(@) Assembling Problems: ‘To have the best combination of basic components to produce
goods according to certain specifications.
(i) Production Problems: To decide the production schedule to satisfy demand and
face of fluctuating rates and storage expenses.
minimise cost
(oii) Job Assigning Problems: To assign job to workers for maximum effectiveness and
‘optimum results subject to restrictions of wages and other costs.
(eiii) Trim-Loss Problem: To determine the best way to obtain a variety of smaller rolls of
paper from a standard width of roll that is kept in stock and, at the same time, minimise
wastage.
(0 Marnemaricat Mopet oF A LINEAR PROGRAMMING PROBLEM
‘A linear programming problem is abbreviated by LPP. The mathematical model of LPP is
given below:
Suppose there are 2 decision variable (:and.) and 3 const
problem can be formulated as:
ints. In this case, maximisation
Maximise Z = ky x + hoy
$$$
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) ee)
Subject to constraints. ayx + by $c,
ax + byy Sey
ase + bay S cy
and x,y = 0
In the above formulation, decision var denoted by x and y. The coefficients of the
decision variable of the objective function are denoted by k, and hg. The symbols ¢,, ¢z and ¢s
represents constraints.
Formulation of minimisation problem can be shown as:
thy
Subject to constraints a,x + by 2 ¢,
et by
aye + by 2 cy
Minimise C = hy
ay
Bey
and x,y 20
It may be noted that in maximisation problem constraints appear as = inequalities and in
nimisation problem the constraints appear as = inequalities.
© Formutarion oF LINEAR PROGRAMMING PROBLEM
Problem formulation is the process of transforming the verbal description of a decision
problem in to a mathematical form that can be solved. The main steps in the formulation of
linear programming problem are as follows:
Step I: Identify the unknown variable (ie., decision variables) to be determined and
assign symbols x; x3 .., etc., to them.
Step II: Identify the objective function and represent it as a linear function of decision
variables.
Step III: Identify all the restrictions or constraints in the problem and express them as
linear inequations or inequalities in terms of decision variables.
The following examples will make the procedure more clear:
Example 1. A home decorator manufactures two types of lamps, say A and B. Both lamps go through two
technicians, first a cutter and then a finisher. Lamp A requires 2 hours of the cutter’s time and
T hour of the finisher’ time. Lamp B requires 1 hour of cutter’s and 2 hours of finisher’s time.
The cutter has 104 howrs and finisher has 6 hours of time available each month. Profit on
Lamp A is 16.00 and on the B lamp is 12.00. Formulate the above problem as a linear
programming problem.
Solution: The given data is shown in the following table:
TypeALamp_| Type B Lamp | Maximum available time
Time for cutting 2hrs, thr. 104
Time for finishing thr. 2hrs, 76
Profit 16.00 212.00
Seanned wiek CamScanner14
Example 2.
Solution:
Operations Research
Let the decorator manufactures x lamp of Type A and y lamp of Type B.
~ x 20,20
‘Maximum time for cuttis
= 104hrs. +. Bet Ly S104
Maximum time for finishing = 76 hrs. «. x + 2y 5 76
Gx + 12y
Let Z be the total profit. od
+. The given LP problem reduces to:
16x + 12y
Subject to the constraints:
Qty 104
x+y < 76
and x20,y20
A diet fora sick person must contain at least 4,000 units of vitamins, 50 units of minerals
‘and 1,400 units of calories. ‘Foo foods A and B are available at a cost of €4 and 23 per
unit respectively. One unit of food A contains 200 units of vitamins. I unit of mineral and
40 units of calories and one unit food B contains 100 units of vitamins, 2 unit of minerals
and 40 units of calories. Formulate this problem as a linear programming problem for
minimising costs
Maximise
‘The given information is shown in the following table:
Food A Food B ‘Maximum requirement
Vitamins 200 100 ‘4,000
Minerals 1 2 50
Calories 40 40 1,400
Cost 4 3
Let x units of Food A and y units of Food B be combined «. x = 0,y = 0
“The minimum daily requirement of vitamins is 4,000.
200x +100y = 4,000
‘The minimum daily requirement of minerals is 50.
x+y 250
‘The minimum daily requirement of calories is 1,400.
2. 40x + 40y = 1400
Z= dx + 3y
‘The given L.P. problem reduces to:
Minimise Z = 4x + 3y
Subject to the constraints 200x + 100y = 4,000
x+y 250
Let Z be the total cost
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method)
Example 3.
Solution:
40x + 40y = 1,400
and x20,y20
‘The above constraints can be simplified as under:
Qty 240
x+ 2250
x+y 235, x20,y20
15
A dealer deals in only two items: sewing machines and table fans. He has & 5,760 to invest
and a space to store at the most 20 items. A sewing machine costs ® 360 and a table fan % 240.
He can sell a sewing machine at a profit of & 22 and a table fun at profit of & 18. Formulate
this problem as a linear programming problem.
The given information is shown in the following table:
Sewing Machine | TableFan | Maximum Investment
Cost per piece * = 360 240 25,760
Profit per piece 22 218 -
Let the dealer purchases x sewing machine and y fans
ox20720
Maximum number of items = 20
nx tys20
Maximum investment = 5,760
J. 360x + 240y < 5,760 or Sx + 2y < 48
Let Z be the total profit,
oe Zm 22x + 18y
2. The given problem reduces to:
22x + 18y
Subject to the constraints:
xt+ys20
360x + 240y < 5,760
and x20,y2=0
Maximise Z
‘The above constraints can be simplified as unde1
xty 520, 3x + 2y 5 48,x20,y20
Seanned wiek CamScanner16
Operations Research
1.
8.
Define Linear Programming and discuss its main concepts.
Define and explain the following terms:
(a) Objective Function (@) Constraints
(d) Feasible Solution (e) Optimum Solution (f) Feasible Region
What is linear programming? Discuss the assumptions and applications of
programming in business.
(©) Non-negative Restrictions
A firms manufacturing two types of products A and B sells them at a profit of € 2.00 on type
A and also 2.00 on type B. Each product is processed on two machines My and Mz. Type A
requires one minute of processing time on M, and two minutes on My. Type B requires one
minute on M, and one minute on Mg. The machine My is available for not more than 6
g any working da
hours 40 minutes while machine My is available for 10 hours durin;
\g problem for maximum pri
Formulate the given problem as a linear program
Consider two different types of food stufls say F, and F,. Assume that these food stuffs
contain vitamins V,, Vz and V, respectively. Minimum daily requirements of three
vitamins are 1 mg of V,, 50 mg of V, and 10 mg of Vy. Suppose that food stuff F, contains
1 mg of V,, 100 mg of Vy and 10 mg of V,, whereas the food stuff F, contains 1 mg of V,,
10 mg of Vz and 100 mg of Vs. Cost of one unit of F; is & 1 and that of F, is & 1.5.
Formulate the LPP for minimum cost diet that would supply the body at least the
minimum requirements of each vitamin.
‘Acompany makes who two kinds of leather belts. Belt A is high quality belt, and belt B
is of lower quality. The respective profits are € 40 and & 30 per belt. Each belt of type A
requires twice as much time as a belt of type B, and ifall belts were of type B, the company
could make 10,000 per day. The supply of leather is sufficient for only 8000 belts per
day (both A and B combined). Belt A requires a fancy buckle and only 4000 per day are
available. There are only 7000 buckles a day available for belt B. Formulate the given
problem as a linear programming for maximising profits.
{A firm manufactures pills in two sizes A and B. Size A contains 2 grains of aspirin, 5 grains
of bicarbonates and 1 grain of codeine. Size B contains 1 grain of aspirin, 8 grains of
bicarbonates and 6 grains of codeine. It is found by users that it requires at least 12 grains
of aspirin, 74 grains of bicarLonates and 24 grains of codeine for providing immediate
effect. It is requested to determine the least number of pills a patient should take to get
jmmediate relief. Formulate the problem as a standard LPP.
‘A firm has.an advertising budget of @ 7,20,000. It wishes to allocate this budget to two
media magazines and televisions, so that total exposure is maximised Each p ce of
magazine advertising is estimated to result in 60,000 exposures, whereas each spot on
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) v7
ult in 1,20,000 expos ich page of magazine advertising
jon costs % 12,000. An additional con
ied that at least (wo pages of magazine advert
ion, Set up the LP model for this problem,
costs € 9,000 and each spot on tele
the firm has spe
3 spots on televi
ition is that
ing be used and at least
9. An animal feed company must produce 200 kg of a mixture consisting of ingredients X,
nd X, daily. X, cost €3 per kg and X, %8 per kg. Not more than 80 kg of X, can be used,
nd at least 60 kg of Xy must be used. How much of each ingredient should be used if the
company wants (0 n
imise cost. Formulate this as a linear programming problem,
10. The manager of an oil refinery has to decide upon the optimal mix of two possible
blending processes, of which the inputs and outputs per production run are as follows:
|
{
j
| television is estimated to r
i
Input Output
Process Crude A Crude B Gasoline X Gasoline Y
1 5 3 5 8
: 2 4 5 4 4
‘The maximum amountsavailable ofcrude Aand Bare 200 unitsand 150 units respectively.
Market requirements show that at least 100 units of gasoline X and 80 units of gasoline Y
must be produced. The profit per production run from process 1 and 2 are % 3 and % 4
respectively. Formulate the LP model for the problem.
(Answers )
4. Maximise Z = 2x + 2y 5. Minimise Z = x, + 1.5xy
Subject to: Subject to:
xty $400 xy tm 21
ae +y < 600 100x, + 10x, = 50
and x20,y20 10x, + 100x, = 10
and x, = 0,20
6. Maximise Z = 40x, + 30x, Minimise Z =x +y
Subject to: Subject to:
2x, +x, < 10,000 w+ys12
x, +x, < 8,000 By + 8) 274
x, S 4,000, x, = 7,000 x + 6y 2 24
and x,20,x,20 and x,y20
8. Maximise Z = 60,000x, + 1,20,00 9. Maximise Z = 3x, + 8ty
Subject to: Subject to :
9,000x, + 12,000x, < 7,20,000 x +x, = 200
x 22x23 x, $80
Seanned wiek CamScanner=
1s
Operations Research
Xx 20
10. Maximise Z = 3x, + 4xy Z = 1,200; x, = 80, x5 = 199
Subject to:
5xy + dxy = 200
3x, + Bxy < 150
5x, + 4x, = 100
8x, + dx, = 80
Xymy zO
GF Souurion oF Linear ProGRAMMING PROBLEM
“The following two methods are used in general for the solution of a linear programming
problem:
1. Graphical Method
2. Simplex Method
In this chapter, we shall study only the graphical method.
1. Graphical Method: The graphical method for the solution of the linear programming
problem is used when the objective function is a linear function of two variables only In
this method, the following steps are involved:
Step I: Consider the constraints as equalities
Step I: Sketch these linear constraint equation as straight lines. For example to daw line
2x + 3y = 6, putx = 0 find y and which is 2 here. Therefore one point on the line
will be (0, 2). Again put y = 0 and find x, which is 3 here. Another point on the
line is (3, 0). Joining these points, we can find the line represented by the equation
2x + 3y = 6.
Similarly for all other linear constraint equations sketch the
Step III: Find the feasible region for the values of the variable, which is the region bounded
by the lines drawn in Step-II
“To find permissible region for a constraint 2x + 3y < 6.
Substitute origin (0, 0) in the corresponding inequation. If the origin satisfies the
inequation (as in this case 0 < 6 is true), then the left side of the line will be the
permissible region, where origin lies. Ifthe origin does not satisfy the in equatio™
then the right side of the line opposite the origin will be the required regio”
Generally for greater than or equal to (2) constraints, the feasible region will be
the area which lies above or tu the right of the constraint line. For less that of
equal to (5) constraints, this area is generally below or to the left of the line drawn
Step IV: Find the common region satisfied by all the constraints (if any) and shade it
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) aa
Step V: Locate the corner points of the region, which may be obtained by simultaneously
solving the two linear equations whose point of intersection is the required point.
Step VI: Calculate the value of the objective function at each corner point obtained in
previous step. The set of values corresponding to the Maximum or Minimum
values of the objective function is the solution of the LPP.
The following examples illustrate the graphical method of LPP:
‘Type I: Maximisation Problems (all constraints are < type)
Example 1. Solve graphically the following LPP:
Maximise Z = 4x + Sy
Subject to constraints
2x + 3y S12
a +ys8
and xy20
Solution _Consider the above constraints as equalities:
2x + By = 12
QW + W=8
Draw these equations on the graph. Points for drawing lines are calculated as:
From equation (i) 2x + 3y = 12
When x = 0, 2(0) + 3y = 125 3y = 12 = 4. (0,4)
When y = 0, 2x + 3(0) = 12 => 2x =12 =x = 6 ~. (6,0)
From equation (ii) 2x + y = 8
When x = 0, 2(0) + = 8=9 =8 ~. (0,8)
Wheny = 0, 2e+0=8=x=4 ~ (4,0)
Now plotting the above equations on the graph as shown below:
2 40 e e
Seanned wiek CamScanner20
Example 2.
Solution:
Operations Research
s the feasible region. This gives four
‘The shaded region in the figure indicate
Ais (0, 4), Dis (4, 0)
corner points O, A, E.and D where O is (0, 0),
To find E, E is the point of intersection of lines
Qe + By = 12
Wwe y=s
Solving these equations, we gets
Thus, Eis (3, 2).
Now, we shall test all feasible solutions for objective function 10
39
et the maximum
value.
Corner Points Coordinates of the Objective Function Value
‘Corner Points: Z=4x+ 5y
° (0.0) 2=4(0) + 5(0) 0
A 0.4) 2=4(0) + 5(4) 20
E 6.2) z= 4(3) +62) 2
D (4,0) z= 4(4) + 5(0) 16
Thus, the maximum value of Z = 22 whenx = 3and y = 2
Solve graphically the following LPP:
Maximise Z = 3x, + 2x»
Subject to constraints
-2x, +x, 51
x, 52
oxp—x, 2-2
and Xp X20
Consider the above constraints into equalities
1 +82 = ®
xy =2 a)
ox -%y 2-2 Gi)
Draw these equations on the graph paper; Points for drawing lines are calculated
as follows:
From Equation (i) -2x, +x, =1
When x, = 0 Pat
When x, = 0 a
-6$0
From Equation (ii) x; = 2
From Equation (iii) -x, —¥y
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) ai
When x, = 0 2 (0,2)
When x, = 0 +. (2,0)
“The shaded region in the figure indicates the feasible region. This gives four points
0, A, Band C where O is (0,0), Ais (0,1), and Cis (2,0)
‘To find B, B is the point of intersection of lines
xy +p = and 2x, +) = 1
Solving these equations, we get
To find C, Cis the point of intersection of lines
ee
37%
3. Thus, Bis (4,3)
xy tm=% m2
Solving these equations, we getx, = 2 x, = 0. Thus, Cis (2, 0)
Now we shall test all feasible solution for objective function to get the maximum.
value.
GamorPoints | cordinates ofthe | Objective Function | Value
Corner Points Z= 3x, +2x,
° (0,0) 3(0) + 2(0) oO
A 0.1) 3(0) +201) 2
B 16 a2) 4 2f8 413
3'3 a als 3
c (2,0) 3(2) + 2(0) 6
Hence Max Z = 6 when x = 2.x, = 0
Example 3. Solve graphically the following LPP:
Maximise Z = 40x, + 36x,
Subject to x, 58
x, <10
——. << arr
Seanned wiek CamScanner22
OPerations Reseaey
5x, + 3xy S45
Where xy) 20
Solution: Consider the above constraints as equalities
@
)
ii)
Draw these equations on the graph. Points for drawing lines are obtained as follows,
From Equation (i) 8 +. 8,0)
From Equation (i ay = 10 +. , 10)
From Equation (iii) Bx, + Buy = 45
Whenx,=0, 35545 = = 15 (0, 15)
Whenx,=0, 5 =45 = 4 =9 - (9, 0)
2
x= 10
(0,10 {#2510
a|
(c¢8, 573)
6
4
2
o
2 4 6 10
D
(8,0)
The shaded region indicates the feasible region. This gives five corner points 0,4:
B Cand D, where O is (0, 0), Ais (0, 10) and D is (8, 0)
‘To find B, B is the point of intersection of lines
Xp = 10, 5x, + Bx = 45
10, 5x, + 3(10) = 45
15x, =3
When x,
2. xy
Thus, B is (3, 10)
To find C, Cis the point of intersection of lines
= 8, 5x, + 3x, = 45
8, 5(8) + 3xy = 45
When x,
oe Oxy = Bay =
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method)
Example 4.
Solution:
23
5
Thus, Gis (8, 3
Now, we shall test all feasible solutions for objective function to get the maximum
value.
‘Comer Points Value
° Z = 40(0) + 36(0) = 0 0
Z=40(0) + 36(10)= 360 | 360
B Z=40(3) + 36(10)= 480 | _ 480
c 6 8) Z=40x8 +36 380
D (8.0) Z= 40 «8 + 36(0) 320
Thus, the maximum value of Z= 480 when x, = 3, x, = 10
A company makes two types of furniture: chairs and tables. The profit for each accounting
department is € 20 per chair and 30 per table. Both products are to be processed on three
machines M,, Mand M,. The time required in hours by each product and total time available
in hours per week on each machine is as follows:
Machine Chair Table Time Available
M 3 3 36
M, 5 2 50
M, 2 6 I 60.
How should the manufacturer schedule his production in order to maximise profit? Use
graphical method to solve this problem.
The mathematical formulation of the problem is as follows:
Maximise Z = 20x, + 30x,
Subject to constraints
3x, + 3x, < 36
bx, + 2x, < 50
2x, + 6x, < 60
and x, 20,%)20
Consider the above constraints as equa
3x, + 3x, = 36 Oy
Bx + 2xy = 50 (ii)
2x, + 6x) = 60 (iii)
Seanned wiek CamScanner24
ee —
Operations Rasy
Draw these equations on graph. Points for drawing these lines are calculate
follows:
From Equation (i) 3x, + 3x, = 36
When x, = 0, 3(0) + 3x) = 36 > 3xp = 36% = 12 (0, 12)
When x, = 0, 3y, + 3(0) x= 12 “. (12, 0)
From Equation (ii) 5x, + 2%; = 50
When x, = 0, 5(0) + 2x, = 50 => 2p = 50 xy = 25 -. (0, 25)
(<,) + 2(0) = 50 => Sx, = 50a, = 10 ~. (10, 0)
6 => 3x,
When — x, =0,
‘From Equation (iii) 2x, + 6x, = 60
When x, = 0, 2(0) + Gry = 60 => Gx, = 60 =x, = 10
When x, = 0, 2x, + 6(0) = 60 = 2x, = 60>,
Now plotting the above equations on the graph, as shown below:
The shaded region indicates the feasible region. This gives five corner points 0,4,
D, FT where O is (0, 0), A is (10, 0), 1 is (0,10)
To find D, D is the intersection of the lines
3x, + 3x, = 36
Bx, + 2xp = 50
<. (0, 10)
30, 0)
Solving these two, we gets; = 72 and xy x
5. (26, 10
Thus, Dis (3 3)
To find F, F is the intersection of the lines
+ Gy = 60; 3x; + Sry = 36
Solving these wo equations, we get x,
Thus, Fis (3, 9)
and xy
Seanned wiek CamScanner—S—S—
Linea
Example 5.
Solution:
+ Programming (Formulation and Graphical Method)
25
Now we shall test all feasible solutions for objective functions to get the maximum
value.
Comer Points | Co-ordinates of the Objective Function Value
Corner Points Z= 20x, + 30x,
fo} (0, 0) 20*0+30*0 0
A (10, 0) 20* 10+30x0 200
26 10 26 10 820
D (3 3] 20x F +302 >
F (3, 9) 20x 3+30x9 330 Z|
I (0, 10) 20x 0+30* 10 300
Hence, the maximum value of Z = 330 when x, = 3, andy, = 9
‘Type Il: Maximisation Problems (Mixed Type Constraints)
Solve the following LPP by graphic method:
Maximise Z = 2x, - 3%
Subject to: 4x, + 5xy = 40
2x, + 6x, S24
3x, — 3x, = 6
x24
and xpx,=0
ider the above constraints as equalities:
4x, + Bx, = 40 @
2x, + Gry = 24 i)
Bx, — Buy = 6 ii)
m=4 (v)
Draw these equations on the graph. Points for drawing lines are calculated as
follow
From Equation (i) 4x, + 5x, = 40
When x, =0 5x =40 => %=8 =. 0,8)
When x)= 0 4x,=40 = x, =10 =. (10,0)
From Equation (ii) 2x, + 6x, = 24
When 0 Gy =24 = a4 0,4)
When xy =0 x= 24 > x= 12 (12, 0)
From Equation (iii) 3x, - 3x, = 6
When 0, -2)
When x)= » (2,0)
Seanned wiek CamScanner26
2g
OPerations Resear,
From Equation (iv) x, = 4 (4,0)
Now plotting the above lines on the graph paper, as shown below:
‘The shaded region in the figure indicate the feasible region. This gives us five
points A, B, C, D and E
where A is (4, 0), and B is (10, 0)
To find C, C is the point of intersection of lines
4x, + Sx, = 40 and 2x, + 6g = 24
Solving these equations, we get x, = 2
7s
Thus, Cis (2,
‘To find D, D is the point of intersection of lines,
3x, - 3p = 6 and 2x, + Gx, = 24
sle0
; . 9 5
Solving these equations, we gets, = 2, = 3
9 5
Thus, Dis (3 5)
“To find E, E is the point of intersection of lines,
3x, - Sty =
Solving these equations, we get, = 4,5
Thus, E is (4, 2)
Now we shall test all feasible solutions for objective function to get the maximum
value.
and x, = 4
————— _—
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method)
Example 6.
Solution:
27
Corner Points | Co-ordinates of the ‘Objective Function Value
Corner Points Z= 2x, + 3x,
(4,0) (2*4)-(3*0) 8
B (10, 0) (2* 10) (3 0) 20
2x82) _ (38 a =
i. 7 ty 7
95 9 5 3
— [es [ees |:
E (4,2) (2x 4)-(3*2) 2
Thus, Maximise Z = 20 when x, = 10 and xy = 0.
Solve the following LPP by graphic method:
Maximise Z = 2.75x, + 4.15%,
Subject to:
2x, + 2.5%, < 100
75x + 5x, 2 150
4x, + 8x, = 160
and xpx)20
Consider the above constraints as equalities:
2x, + 2.5xq = 100 @
7.5x, + Bx, = 150 i)
4x, + 8x, = 160 ii)
Draw these equations on the graph. Points for drawing lines are calculated as
follows:
From equation (j) 2x, + 2.5x, = 100
When — x, = 0, 2(0) + 2.5x, = 100
When xy = 0, 2x + 2.5(0) = 100
From equation (ji) 7.5, + 5x, = 150
When x, = 0,7.5(0) + 5x, = 150
When — x, = 0,7.5x, + 5(0) = 150
From equation (iii) 4x, + 8x, = 160
When x, = 0, 4(0) + 8x) = 160 =>
When x, = 0, 4x, + 8(0) = 160 =>
=> xy =40
=> x= 50
=> x, =30
=> = 20
x = 20
x = 40
©. (0, 40)
+. (60,0)
©. (0, 30)
©. (20, 0)
(0, 20)
- (40, 0)
Seanned wiek CamScanner28
Example 7.
Now plotting the above equations on the graph as shown below:
=
Operations Research
The shaded region in the figure indicates the feasible region for values of x, and
2: This gives five comer points A, B,C, D and E where B is (40, 0), C is (50, 0), D
is (0, 40) and E is (0, 80).
‘To find A, A is the point of intersection of lines
4x, + Bxy = 160 and 7.5x, + 5xy = 150
Solving these equations, we get x,
Thus, A is (10, 15)
Solving these eq}
‘Thus, A is (10, 15)
0.x,
tions, we get x, = 10, x) = 15
Now we shall test all feasible solutions for objective function to get the maximum
value.
Comer Points | Co-ordinates of | Objective Function Z= Value
Corner Points | 275%, +4158,
A (10,15) Z=2.75 (10) + 4.15 (15) 89.75
B (40,0) = 2.75 (40) + 4.15 (0) 110.0
c (50,0) .75 (50) + 4.15 (0) 137.5
D (0,40) Z= 2.75 (0) + 4.15 (40) 166
E (0,30) Z=2.75 (0) + 4.15 (30) 124.5
Hence, the maximum value of = 166 when x, = Oand x,
0.
Using graphic method, solve the following LPp
Maximise Z = 7x + 10y
Subject to:
x+y 30,000
y = 12,000
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) ”
Solution:
x 2 6,000
Consider the above inequalities as equaliti
x+y = 30,000 “)
qi)
(iii)
(iv)
Draw these equations on the graph. Points for drawing lines are calculated as
follows:
From equation (i) x + y = 30,000
When 0,0 +y = 30,000 => y= 30,000 +. (0, 30000)
When» =0,x+0.= 30,000 => x= 30,000 =. (80,000, 0)
From equation (ii) y = 12,000 ~ (0, 12000)
From equation (iii) x
000 ©. (6,0000)
From equation (iv) x-y = 0
When x =0,0-y=0=y=0 <0, 0).
When y= 0,x-0=0>x=0 <0, 0)
When x = 6,000, 6,000 -y = 0 => y = 6,000 <. (6000, 6000)
Now plotting the above equations on the graph as shown below:
30,000
‘The shaded region indicates the feasible region for values of x and y. This gives five
corner points A, B, C, D and E where A is (6,000, 0), B is (30,000, 0).
Seanned wiek CamScanner~
Operations Resear
‘arch
To find C, © is the point of intersection of lines
& + = 30,000 and y = 12,000
8,000, 9 = 12,000
Solving these equations, we get x
‘Thus, C is (16,000, 12,000)
To find D, D is the point of intersection of lines.
,000
= andy =
Solving these equations, we get x = 12,000, y = 12,000
Thus, D is (12,000, 12,000)
To find E, E is the point of intersection of lines.
*-y = Oand x = 6,000
Solving these equations, we get x = 6,000 and y = 6,000
Thus, E is (6,000, 6,000)
Yow, we shall test all feasible solutions for objective function to get the maximum
aluc.
[comer Points | Co-ordinates of | Objective Function Value
Corner Points Z=7x+ 10y
(6,000, 0) Z=7 (6,000) +0 42,000
(20,000, 0) Z=7 (30,000) +0 2,10,000
(18,000, 12,000) 2=7 (18,000) + 10 (12,000) | 2.46,000
(12,000, 12,000) Z=7 (12,000) + 10 (12,000) 2,04,000
mlololol>
(6,000, 6,000) Z=7 (6,000) + 10 (6,000) 1,02,000
2,000.
‘Thus, the maximum value of Z = 2,46,000 when x = 18,000 and y
Example 8. A marketing manager wishes to allocate his annual advertising budget © 20,000 in two
media A and B The unit cost of a message in media A is® 1,000 and in media B is ® 1,500
Media A is monthly magazine and not more than one insertion is desived in the issue. At lets!
{five messages should appear in media B. The expected effective audience for one message
media A is 10,000 and for media B is 50,000. Formulate it as LPP and solve graphical
Solution: Let No. of advertisement in Media A = x,
° Number of advertisement in Media B = x,
0,000x, + 50,000%,
Maximise Z
Subject to:
1,000x, + 1,500x, < 20,000
x5
x22
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) a1
Whereas 4, x) 2 0
Rewrite the problem as:
Maximise Z = 40,000x, + 50,000 xy
Subjectto: 2x, + 3x, = 40
xsl
xy 25
where xy, 25
Converting inequalities into equalities
Qu, + Bxy = 40 @
nel i)
med (ity
Draw these equations on the graph. Points for drawing these lines are calculated as
follows:
From equation (i) 2x, + 3x, = 40
When x, =0, 043x,=40 => xy = 40/3 =. (0, 40/3)
When x) =0, 2x, +0=40 = x, =20 +. (20,0)
From equation (ii), x, = 1 + (1,0)
From equation (iii), x, = 5 © 0,5)
Now plotting the above equations on the graph paper as shown below:
P Ss ‘q| graph paps
‘The shaded region indicates the feasible region for
four corner points A, B, C and D, where A is (0, 40/
alues of x, and x9. This gives
), and D (0, 5).
Seanned wiek CamScanner32
Example 9.
Solution:
Operations Research
To Find B, Bis the point of intersection of lines
40 and x, =1
Qe, + Bx,
Solving these equations, we get
‘Thus, B is (1, 3)
To Find C, Cis the point of intersection of lines x, = 1, and
‘Thus, C is (1, 5)
Now we should test all feasible solutions for objective function to get the maximum
value
Corner Points Co-ordinates: ‘Objective Function Max.
Z= 40,000 x, + 50,000 x,
A (0, 40/3) % 666666.67
B (1,38/3) %673333.33 |
c (4.5) % 2,90,000
D (0.5) % 2,50,000
Thus, the maximum value of Z = 6,73,333.33 when
xy =1,andx, &
A retired person wants to invest up to an amount of & 30,000 in fixed income securities. His
broker recommends investing in two bonds: Bond A yielding 7% and Bond B yielding 10%.
After some consideration, he decides to invest at most® 12,000 in Bond Band at least ® 6,000
in Bond A. He also wants amount invested in Bond A to be at least equal to amount invested
in Bond B. What should the broker recommend if investor wants to maximise his return on
investment? Formulate as LLP and solve graphically.
Let X, be the amount invested in bonds A and X, be the amount invested in
bonds B. Investor is to maximise his return on these bonds yielding 7% and 10%
respectively.
So Maximise Z = 7% X, + 10% Xy Maximum return
Subjectto: —_X, +X, $ 30,000 Investment constraint
X_ $12,000 Investment constraint
X, = 6,000 Investment constraint
where X, and X, = 0
Converting the inequalities into equalities to find out the coordinates of the lines
to draw on the graph.
X, +X, = 30,000 = (30,000, 30,000) a)
Xy = 12,000 > (0, 12,000) (2)
X, = 6,000 > (6000, 0)
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) 33
Drawing these lines on the graph paper. We get
35000]
30000) FF Ill x, = 6000
25000
20000
(18,000, 12,000)
15900] fF p= 12000
10000]
5000)
0
5000 1000 15c00 20000 25000 2000 35000
The feasible solution region is bounded by the points PQRS. The value of Z is
calculated at these points as follows:
Corner Points Co-ordinates _ Max.Z= 7% x, + 10% x,
Pp (6,000, 0) Z=420
Q (30,000, 0) Z=2,100
R (18,000, 12,000) - eS oe
Z= 18,000 * 795 + 12,000 * yo5 = 2,460
s (6,000, 12,000) - x x.
Z=6,000% jo + 12,000 7oq = 1.620
‘The values of Z is maximum at R, where X, = 18,000
X, = 12,000
460
Example 10. Solve graphically, the following LPP:
Max. ZL = 2x, + 3x
Subject to: x, + x» $30
Seanned wiek CamScanner34
Solution:
Operations Research
‘Treating the above constraints to equalities for the time being we get
x +x) = 30
m=8
x= 12
yay = 0
x, =20
From (1)
Where,
From (2)
From (3) x
From (4)
From (5)
Plotting the above lines on the graph we get
%
30.
2
2
°
ol)
(2)
(3)
(4)
(5)
(0, 30)
(30, 30)
(0, 3)
(0, 12)
(0, 0)
(20, 0)
The solution region satisfying the given constraints and meeting the non-negativity
restrictions x, 2 0 is shown in shaded figure above. Any point in this region is
feasible.
Comer Points Co-ordinates
A (3)
B (12, 12) 2(12)+3 (12)=60
c (18, 12) 2 (18) +3 (12)=72
D (20, 10) 2 (20) + 3 (10)= 70
E (20, 3) 2 (20) +3(3)=49
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) 35
Example 11.
Since the maximum value of Z is 72, which occurs at point C so
xy = 18, x9 = 12, Max. Z = 72
An aduertising agency wishes to reach two types of audiences - customers with annual income
greater than one lakh rupees (target audience A) and customers with annual income of
less than one lakh rupees (larget audience B). The total advertising budget & 2,00,000.
One programme of TV advertising costs 50,000; one programme of radio advertising costs
%20,000. For contract reasons, at least three programmes ought to be on TV and the number
of radio programmes must be limited to five. Surveys indicate that a single TV programme
reaches 4,50,000 prospective customers in target audience A and 50,000 in target audience
B. One radio programme reaches 20,000 prospective customers in target audience A and
80,000 in target audience B. Determine the media mix so as to maximize the total reach.
Let us define the following decision variables:
x, and x, = number of programmes to be released on TV and radio, respectively.
‘Then the LP model of the given problem can be expressed as:
Maximise Z = (4,50,000 + 50,000) x, + (20,000 + 80,000) xy
subject to the constraints:
(i) 50,000x, + 20,000x, < 2,00,000 or 5x, + 2x < 20 (Budget constraint)
(i) x, 2 3; xy <5 (Programmes) TV/Radio
and x, x, = 0
Converting inequalities into equalities
Buy + Qvy = 20 “
x23 (i)
a5 Co)
Draw these equations on the graph. Points following these lines are calculated as
follows:
From equation (i) 5x, + 2x, = 20
When x, =0 0+ 2x = 20 => x= 10 (0, 10)
When x, =0 bx, +0=20 > x,=4 (4, 0)
ix =3 -. (3, 0)
2 (0,5)
From equation
From equation
Seanned wek CamScanner36
Operations Research
Now plotting the above equations on the graph paper
10
Bey + 2rp=20
o a a a)
The shaded region indicates the feasible region for values of x, and 3
70 %
. This gives
three corner points A, B, and C where A (8, 0) and B (4, 0).
To find C, C is the point of intersection of lines
Bx, + 2xy = 20 and x, = 3
Solving these equations, we get x; = 3, x, = 5/2
Now, we shall list all feasible solutions for objective function to get the maximum
value.
Comer Points | Co-ordinates Objective Function Max.
: Z=5,00,000x, + 1,00,000x,
A (3,0) Z = 5,00,000(3) + 1,00,000(0) = 15,00,000
B (4,0) Z = 5,00,000(4) + 1,00,000(0) = 20,00,000
c 8 3) Z=5,00,000(3) + 1,00,000( ) = 17,50,000
Since the maximum value of Z = 20,00,000 occurs at the poi
programmes on TV and x,
the agency must release, x,
on radio in order to achieve the ma
B (4, 0), therefore,
0, ie., no programme
20,00,000 audiences.
ximum reach of 7
can be bought at® 2 each and young ones at & 5 each. TI
Example 12. Old hens can igh ‘young ones at each. The old hens lay 3
seek and the young ones lay 5 eggs per week, each egg being worth 30 paise. A hen eel
per week to feed. Mr. Amit has only ® 80 to spend for hens. How many of each hind should
Mr. Amit buy to give a profit of at least
6 per week, assuming that Mr. Amit cannot have
sore than 20 hens? Solve the linear programming problem graphically,
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method)
Solution:
Let x; be the number of old hens and x, be the number of young hens
‘The problem is formulated as:
Max. Z = 0.3 (Bx, + 5xy) = M(x, + 9)
2x, + Sry < 80
xy + xy 5 20
-0.1x, + 0
Whereas Xp Xp 20
Subject to:
26
Making inequalities of the constraints to equalities for the purpose to pl
above values on the graph, we get
2x, + 5x, = 80
xy + = 20
~O.1x, + Bry = 6
From (i) equation
When x, =0,
x =0
From (i) equation
When x, = 0, xy = 20
x = 20
From (iii) equation
When x, = 0, xy = 12
: x, =-60
*y
@
(i
(ii)
Cost constraint
Space constraint
Profit constraint
Non negativity
(0, 16)
(40, 0)
(0, 20)
(20, 0)
(0, 12)
--(-60, 0)
Now plotting the above lines on the graph, we get the following figure:
Profit function
37
jot the
The feasible region is bounded and its extreme points are A,B,C. Values for x and
x, are the intersection points obtained with the help of simultaneous equations.
Seanned wek Camscanner38 Operations Research
For B point x, +x) = 20
~O.1xy + Bry = 6
After solving simultaneously, we get x,
40
3
The Z values corresponding to these extreme points are calculated as under:
[ Corner Points | Co-ordinates Max. Z = -0.1x, + 5x, Value
A (0,12) {0.1 « 0) + (5 * 12) 6
20 40 20 40
B -{o.1x 20) + (5x2 6
(B3) [tors] (#3)
c (0, 16) (0.1 x 0) +(.5 * 16)
Since the maximum value of Z occurs at G, the solution to the given problem is
X, = 0,%9 = 16 and Max Z =% 8
Hence, Mr. Amit can buy 16 young hens and no old hens in order to get maximum
profit of 8.
CExercise 2 )
1. What do you understand by linear programming problem? Explain the graphic method
of solving a linear programming problem.
2. Solve graphically the following LPP:
Maximise Z = 50x + I5y
Subject to the constraints
bx + ys 100
x+y <60
and = = 0 [Ans, Max. Z = 125, x = 10, y = 50)
. Solve graphically the following LPP:
Maximise Z = 5x + 7y
Subject to the constraints
12e + 12y = 840
Bx + 6y < 300
8x + 4y < 480
and x2 0,920 (Ans. Max, Z = 410, = 40,9 = 30)
4, Solve the following LPP graphically:
Maximise Z = 4x + 6y
Subject to the constraints
xtys5
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) 39
xs2
ys4
my20. [Ans, Max. Z = 28, x = 2,9 = 3]
5. Using graphic method, solve the following LPP
Maximise Z = 7x + 10y
Subject to the constraints
x+y $30,000
y = 12,000
x = 6,000
xey
x 20. [Ans. Max. Z = 24,600, x = 18,000, y = 12,000]
6. Acompany produces two types of pen, say Aand B, Pen A isa superior quality and pen B
is. lower quality. Profit on pens A and B is 5 and %3 per pen respectively: Raw material
required for each pen A is twice as that for pen B. The supply of raw materials is sufficient
only for 1000 pens of type B per day. Pen A requires a special clip and only 400 such clips
are available per day. For pen B, only 700 clips are available per day. Find graphically the
production mix so that the company can make maximum profit.
Hints: [Max. Z=5x, +3%y, 2x; + %» 1000, x; $400, x9 $ 700]
[Ans. Max. Z = 2,850, x, = 150, x2 = 700]
7. Afirm manufacture two products A and B on which the profits earned per unit are 73 and
%4 respectively. Each product is processed on two mahcines M, and M,, Product A requires
one minutes of processing time on M, and two minutes on M, while B requires one minute
on M, and one minute of M,. Machine M, is available for not more than 7 hrs. 30 minutes
while machine M, is available for 10 hrs. during any working day. Find the number of units
of products A and B to be manufactured to get maximum profit. (Use graphaic method).
Hints: [Max. Z = 3x, + 4x, x, +, $450, 2x, + x, 600, x, 20, x, 20]
[Ans. Max. Z = 30, x, = 0.x,
8. Solve graphically the following LPP:
Maximise Z = 40x, + 80x,
Subject to 2x; + 3x, < 48
x s15
x < 10
where — X,%) 20 [Ans. Max. Z = 1,160, x, = 9, *;
9, Solve graphically the following LPP:
Maximise Z = 300x + 400;
Subject to 5x + 4y < 200
3x + 5y S150
5x + 4y = 100
10)
Seanned wek CamScanner40 Operations Research
8x + 4y = 80
and x,y 20 [Ans.
10. Solving following LPP by graphical method
(Maximise Z = x, - 3x,
Subjectto x; +x» $300
400
= 150
RTT)
xy 2ry S200
2x, tay = 100
x, = 200
Where xp my 20
(ii) Maximise Z = 10x, + 15x,
Subject to 2x, + xy 5 26
Qty + dp S56
xy—% 2-5
Where px 20 [Ans. (i) x, = 200, x, = 0, Max. Z = 200,
(i) x, = 8, x) = 10, Max. Z. = 230]
© Type III: Minimisation PROBLEMS (ALL CONSTRAINTS ARE > TYPE)
Example 13, Using graphic method to solve the following LPP:
Minimise Z = 5x, + 3x,
Subject to 2x, +x, 23
xy tx22
and Xp x20
Solution: Consider the above constraints as equalities
Wx, tx, = 3 @
xy tm =2 (i)
Draw these equations on graph. Points for drawing lines can be calculated as
follows:
From equation (i) 2x + x, =
When — x, = 0,2 (0) +2,
When x, = 0, 2x, +0=3 =x,
From equation (ii) x, + x, = 2
When x
When x,
0,2)
+ 2,0)
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) 41
Plotting the above equations on the graph as shown below:
7 2eaos 4
‘The shaded region indicates the feasible region. This gives three comer points A,
Band C where A is (0, 3) and Cis (2, 0).
To find B, B is the intersection of lines
2x, + xy =Band.xy + xp = 2
Solving these equations, we get, = 1, x2
Thus, Bis (1, 1).
Now we shall test all feasible solutions for objective function to get the minimum
values.
Comer Points Co-ordinates Objective Function | Value
Min. Z= 5x, +3y,
A (0.3) 5(0)+3x3 9
B (1,1) 5(1)+ 31 8
c (2,0) §(2)+3*0 10
Thus, the minimum value of Z = 8 when x,
Example 14. A diet for a patient must contain at least 4,000 units of Vitamins, 50 units of Minerals and
1,400 units of Calories. Two foods F, and F, are available at cost of & 4 and & 3 per unit
respectively. If one unit of food F, contains 200 units of Vitamins, 1 unit of Mineral and 40
units of Calories and one unit of food F contains 100 units of Vitamins, 2 units of Minerals
and 40 units of Calories, find by graphic method, what combination of fooding should be used
to have least cost.
The mathematical formulation of the given problem is as:
Minimise Z = 4x, + 3x,
Subject to constraints
200x, + 100x, = 4,000
Seanned wiek CamScanner42
Operations Research,
xy + 2x 50
40x, + 40x, = 1,400.
and xy,x)20
The above constraints can be simplified as under:
ep tay 240, xy + xy E50, xy tay S35, xp Ky BO.
Consider the above constraints as equalities:
2x, +x, = 40 @
xy + 2x) = 50 oy
xy tx, = 35 (ii)
Draw these equations on the graph. Points for drawing lines can be calculated as
follows:
From equation (i) 2x, + x = 40
When x, = 0,2) = 40 ©. (0,40)
When — x, = 0, 2x, = 40>, = 20 © 20, 0)
From equation (ii) x, + 2x, = 50
When x, = 0, 2x, = 50 =x, = 25 2 0,25)
When x, = 0,x, = 50 “. 60, 0)
From equation (iii) x, + x, = 35
When x, = 0,x) = 35 - (0, 35)
+ (35, 0)
Plotting the above equations on the graph as shown below:
When — x, = 0,x, = 35
The shaded region indicates the feasible region. This gives four points A, B, Gand
D for which A is (0, 40), D is (50,0)
‘To find B, B is the point of intersection of the lines.
Qe, t xy = 40, xy ty = 35
Seanned wiek CamScanneraii
Linear Programming (Formulation and Graphical Method)
43
Solving these equations, we get x, = 5, and x) = 30,
Thus, B is (5, 30)
To find C, C is the point of intersection of the lines.
xy + 2xy = 50, xy tx = 38
Solving these equation, we get x.
Thus, C is (20, 15)
15, x, = 20
Now, we shall test all the feasible solutions for the objective functions to get the
minimum value:
Comer Points Co-ordinates | Objective Function | Value
Min, Z= 4x, + 3x,
A (0, 40) Z= 4(0) + 3(40) = 120
B (5, 30) Z= 4(5) + 3(30) = 110
c (20, 15) Z = 4(20) + 3(15) = 125
D (50, 0) Z=4(50) + 3(0) = 200
‘Thus, the minimum value of Z = 110 when x, = 5 and x, = 30
iet should contain 5 units of food F, and 30 units of
Hence, to have least cost, the
food F.
Example 15. Mohan-Meakin Brewaries Ltd. has two bottling plants one located at Solan and the other at
Solution:
Mohan Nagar. Each plant produces three drink—Whisky, Beer and Fruit Juice named A, B,
C respectively. The number of botile produced per day as follows:
Plant at
Solan Mohan Nagar
Whisky A, 1,500 1,00
Beer B 3,000 1,000
Fruit Juice C 2,000 5,000
A market survey indicates that during the month of April, there will be a demand of at least
20,000 bottles of Whisky, 10,000 bottles of Beer and 44,000 bottles of Fruit Juice. The
operating cost per day for plants at Solan and Mohan Nagar are 600 and 400. Find how
many days each plant be run in April so as to minimise the production cost, which will meeting
the market demand, (Use graphical method)
Let the plant at Solan and Mohan Nagar run for x and y days respectively.
x20 y20
1,500x + 1,500) 2 20,000, => 3x + 3y = 40
8,000x + 1,000y = 40,000, = 3x +y = 40
2,000x + 1,500y = 44,000, => 2x + 5y = 44
Seanned wek CamScannerOperations Research
The objective function is
Min. C = 600x + 4009
Consider the above constraints as equalities
3x + 3y = 40 @
3x +y = 40 i)
x + by = 44 (iii)
Draw these equations on the graph. Points for drawing these lines are calculated as
follow:
From equation (j) 3x + 3y = 40 |
40 40
when x= 0,3) =40=9y= 2 0,3) |
when y= 0,3 = 40x = 2
From equation (ii) 3x + y = 40
when y=40 + (0,40)
when y= 0,36=40x= 40 2 (22,0)
3 3
From equation (iii) 2x + 5y = 44
44 44
when x= 0,5y=44=99= > 20,5)
when y= 0, 2x = 44% = 22 ~ (22, 0)
Now plotting these points on the graph as shown below:
eee
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method)
45
The shaded region indicates the feasible region. This gives three points C, E and
D where Cis (0, 40) and Dis (22, 0)
To find E, E is the point of intersection of the lines
3x +y = 40 and 2x + 5y = 44
Solving these equations, we getx =12,y
Thus, E is (12, 4)
Now, we shall test all feasible solution for the objective function to get the minimum
value.
Corner Points | Co-ordinates of Corner | Objective Function | Value
Points Z= 600x + 400y
(0, 40) Z = 600(0) + 400(40) 16,000
(12, 4) Z = 600(12) + 400(4) 88,00
(22, 0) Z=600(22)+ 4000) | 13,200
Hence, the minimum operational cost is minimum when the plant at Solan run for
12 days and plant at Mohan Nagar run for 4 days.
Tyee IV: Minimisation Prostem (Mixeo Type ConsTRAINTS)
Example 16. Solve by graphic method the following LPP:
Minimise Z = 2x, + x,
Solution:
Subject to 5x, + 10x, < 50
xy tx 21
x)<4
where Xp my 20.
Consider the above constraints as equalities:
bx, + 10x, = 50 “i
xptm=1 (i)
xa (ii)
Draw these equations on the graph paper. Points for drawing lines are calculated
as follows:
From equation (i) 5x, + 10x, = 50
when.
when
x1 = 0, 5 (0) + 10x, = 50 = xy =
0, 5x, + 10(0)
x 504,
From equation (i) x, +, = 1
when
when
x =0,0+m = 19%
y= 0.x, =0=1=9x,=1
5
10
(0,5)
v. (10, 0)
20,1)
© (1,0)
Seanned wiek CamScannerOperations Research
From equation (iii) x, = *. (4,0)
Plotting these points on the graph as shown below:
y
‘The shaded region indicates the feasible region. This gives five points A, B, C, D,
E where A is (1, 0), B is (0, 1), Cis (0, 5) and Eis (0, 4).
To find D, D is the point of intersection of lines
5x, + 10x, = 50,x, = 4
5(4) + 10x, = 50 => 10x, = 30 xy =
Thus, D is (4, 3)
Corner Points Co-ordinates of Objective Function
Corner Points Min. Z=2x,+x,
A (1,0) 2(1)+0=2
B (01) 2(0) +
c (0,5) 2(0)+5=5
D (4,3) 2(4)+3=11
E (4,0) 2(4)+0=8
Hence, Minimum value of Z = I when x, = Oand x,
EXERCISE 3
|. Solve the following LPP graphically:
se Z = Bx, + Gry
Subject to 2x, + 5xy = 1,500
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) a
3x, +x, 2 1,200
where xy x)20 [Ans. Min, Z = 2,700, x, = 4:500, , = 2100)
2. Solve the following LPP graphically:
Mi
Subject to 1,500x, + 1,500x, = 20,000
3,000x, + 1,000x, = 4,000
20,000x, + 5,000x, = 44,000
where xj,%) 20 [Ans, Min. Z = 8,800, x, = 12, x) = 4]
3. Achemist requires 10, 12 and 12 units of chemicals A, B and C respectively for his analysis.
A liquid product contains 5, 2 and 1 units of A, B, and G respectively per jar and its cost
is €3 per jar. A dry product contains 1, 2 and 4 units of A, B and C per carton and costs
per ®2 carton. How many of each should be purchase in order to minimise the cost and
meet the requirements? (Use graphic method)
imise Z = G00x, + 400x,
[Hints: Min. C = 3x, + 2xy, Subject to 5x, + x 2 10, 2x; + Qxy Z 12x, + 4xy = 12,24) %y =O]
[Ans. Min. Cost= 13,7, = 1, and xy = 5]
4, A farm is engaged in breeding pigs.The pigs are fed on various products grown on the
farm. In view of the need to ensure certain nutrient constraints (call them x, y an
is necessary to buy two additional products, say A and B. One unit of product A contains
36 units of x, 3 units ofy and 20 units of z. One unit of product B contains 64 units of x,
12 units of y and 10 units of z. The minimum requirement of x, y and z is 108 units, 36
units and 100 units respectively. Product A costs 20 per unit and product @ 40 per unit.
Formulate the above as a linear programming problem to minimise the total cost and
solve the problem by using graphic method. _[Ans. Min. G = 160, x, = 4 and xy = 2]
5. Solve graphically the following LPP:
Minimise Z = 4x, - 2¢y
Subject to xytx 60
3x, + 7x, 5 84
xy + Qe, = 18
where xp 20 (Ans. Min. Z = 108, x, = 18 and x = 0]
GF Some Exceptionat Cases In LincaR PROGRAMMING
So far we have discussed only those cases in which a unique optimum solution could be
found. But there may exist a few problems where no solution exists or for which the only solution
exists is an unbounded one or sometimes multiple solutions may exist for a given problem,
(1) Infeasible Solution (or No solution): Sometimes the system of constraints in a LPP has
no common point which satisfies all the constraints. In such cases, the LPP is said to have no
feasible solution or infeasible solution.
The following examples illustrate the cases of infeasible solution:
Example 17. Use graphical method to solve the following LPP:
Maximise. Z = x + 4y
Subject to the constraints:
xtysl
xt 224
x20y20
Consider the above constraints as equalities
xtyel @
nt wed (i)
Solution:
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) 49
Draw the above equations on the graph, Points for drawing lines are calculated as
follows:
From equation (i) x + y =
when = x=0,y=1 2,1)
when = y=0,x=1 2,0)
From equation (ii) 2x + 2y = 4
when x= 0,2y=4=y=2 2 (0,2)
2 2 (2,0)
Now plotting the above points on the graph as shown below:
when y= 0,2e=4=
8 A(t) ©(2,0)
“The shaded region indicates the feasible region. In this graph, we find that at no
point the two constraints intersect each other and thus, they have no point or area
in common. The two portions are disjoint. Thus, we cannot find a single point (x,
5) which can be in both the regions. Hence the given LPP has no optimal solution.
Example 18, Solve graphically the following LPP:
Solution:
Maximise Z = 3x, + 4%,
Subject to the constraints
xy-%) 5-1
ox, $x, 50, ie, xj)—xy =O
and xy%)20
Consider the above constraints as equalities
xpody = a1 w
x20 Gi)
Draw these equations on the graph. Points for drawing lines can be calculated as
follows:
ax, +x, = 0 oF
From equation (i) ,-%; = -1
l=x=1 =O)
when x, = 0,0-
Seanned wek CamScanner50 Operations Research
when x) = 0,5, lox 21,0)
From equation (ii) -x, + , = 0, ie. %1—% =
when x, = 0,0-x, =O0>x,=0 +: (0,0)
when x, = 0,x;-0 = 0=>x, =0 + (0,0)
Plotting these points on the graph, as shown below:
Y
From the graph, itis clear that at no point the two constraints intersect each other
and they have no point or area in common. The two portions are disjoint. Thus,
we cannot find a single point (x, y) which lie in both the region. Hence, the given
LPP has no optimal solution.
(2) Unbounded Solution: A linear programming problem may have unbounded solution
which means that it has no limit on the constraints. It simply means that the common feasible
region is not bounded in any respect. The primary variables can take any value in the unbounded
region. The objective function can be made infinitely large. The following example illustrate the
case of unbounded solution:
Example 19. Using graphical method to solve the following LPP:
Maximise Z = 4x, + 5x,
Subject to constraints:
xptxye
H2x, +x, 1
4x, — 2x 21
and xy%,20
Solution: Consider the above constraints as equalities
xy tayo @
+x=1 (i)
4x, - 2x = 1 (iii)
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method) 51
Draw these equations on the graph. Points for drawing lines are obtained as follows
From equation (i) x, +x, = 1
when 200)
when 2 (1,0)
From equation (ii) -2x, +x, = 1
when x, =0,xy = 1 OL
when
From equation (iii) 4x, - 2x, = 1
when x)= 0,x.=- 2 -%
when x; = 0.x, =} C40
Plotting these points on the graph, as shown below:
E(0, -%)
f The shaded area above the point C and B indicate the feasible region. However, it
t is unbounded on the upper side. Since, the feasible region is unbounded, and it is
not possible to indicate the optimal solution though one may exist.
Example 20. Using graphical method to solve the following LPP:
Maximise Z = 2x, + x2
Subject to constraints:
x,-x, S10
2x, 40
and x,x,20
Seanned wie Cam Scanner>
52 Operations Research
Solution: Consider the above constraints as equations
x 10 @
2x, = 40 (ii)
Draw these equations on the graph. Points for drawing lines are obtained as follows:
From equation (i) x, -x,
when x, = 0,x9 =. (0, -10)
when xy -. (10, 0)
+. (20, 0)
‘The shaded region above the point 0, Aand B indicate the feasible region. However,
it is unbounded on the upper side. Since, the feasible region is unbounded, and it
is not possible to indicate the optimal solution.
(3) Multiple Optimum Solution: In certain linear programming problems, situation may
arise when there is the possibility of more than one optimum solution. The following example
illustrates the case of multiple optimum solution,
Example 21. Use graphical method to solve the following LPP:
Maximise Z = 10x, + 6x,
Subject to constraints:
5x, + 3x, 330
x, + 2x, 518
and x) %,20
Solution: Consider the above constraints as equalities
Bay + Sx = 30 w@
ay + 2xy = 18 (ii)
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method)
Draw these equations on the graph. Points for drawing lines are obtained as follows:
From equation (i) 5x, + 3x,
when x, = 0, 3x
when xy
From equation (ii) x, + 2x,
when x = 0, 2x) = 18 >>,
when x) =0,x, = 18
Plotting these points on the graph as shown b
*. (0, 10)
(6,0)
209)
+ (18, 0)
wclow:
The shaded region indicates the feasible region. Thus, gives points O,
where O is (0, 0), C (0, 9), Ais (6, 0)
To find E, E is the point of intersection of lines
Bx, + 3x
0 and x, + 2x, = 18
a= 80
Solving these, we get x,
Thus, Eis (94, 694)
Now, we shall test all feasible solutions for objective function to get the maximum
value.
Comer Points Co-ordinates of Objective Function
Corner Points Max. Z= 10x, + 6x,
c (0,9) Z = 10(0) + 6(9) 54
6 60
E (5) ston sex] 00
7 Z= 10% 5 46% 7
A (6, 0) Z=10* 6 +6(0)= 60
‘Thus, it is clear that at two points E and A, the value of Z = 60. ‘Thus, no unique
optimal solution exists for this problem. Such a problem is said to have alternative
Seanned wek CamScanner7
co Operations Research
optimal solution. There are in fact, an infinite number of values of x, and x, that
give the same value of the objective function. Thus, any point on the line between
Aand B give an optimal solution.
(4) Redundant Constraint: A linear programming problem may have some timea redundant
constraint, A redundant constrain is simply one that does not affect the feasible solution region,
Consider the following example:
Maximise P= 3x, + @
Subject to xytys4 (i)
Qe, +p 56 (ii)
x S7
yx 20
‘The third constraint x, $7 is redundant as it has no effect on the possible region
obtained from first two or more restrictive constraints.
EXERCISE 4
1. Explain how would you identify the cases of redundant constraints, no solution, multiple
solution and unbounded solution from the graph of a LPP, involving two variables. Give
a rough sketch of each case
Solve graphically the following LPP:
2.
Maximise Z = x + 4y
Subject to xtysl
w+ wed
where 20,720 [Ans. No. Solution]
Seanned wiek CamScannerLinear Programming (Formulation and Graphical Method)
3.
=
Solve graphically the following LPP:
Maximise Z = =x + 4xy
Subject to \
~0.3x) + 1.2% <3
where ee)
Solve the following LPP by graphic method:
Maximise Z = 5x, + 4x,
Subject to 2x, -4xy S 1
Qe, + dey BB
where xpxy 20
Solve the following LPP by graphic method:
Maximise Z = x, + xp
Subject to xy +x, S1
8x, $x 23
where XyXy 20
Solve graphically the LPP:
Maximise Z = 4x, + 4x,
Subject to x + xy < 10
6x, + Gx < 36
x4
where xy %y 20
‘Solve graphically the LPP:
Maximise Z = 3x, + 2xy
Subject to 2x, +x, <2
Bx, + dxy < 12
x 20,%)20
Solve graphically the LPP:
Maximise Z = 4x + 3y
Subject to 3x + 4y = 24
8x + 6y $48
xsy
ys5
xy 20
55
[Ans. Unbounded Solution]
[Ans. Unbounded Solution]
[Ans. No Solution]
[Ans. Multiple Optimal Solution Z = 26 at (2, 4), (4, 2)]
[Ans. No Solution]
[Ans. Multiple Optimal Solution Z = 24 at (5, é yor (
Seanned wek CamScanner
a4
7
24
Zi56
9. Given:
Maximise Z,
000, + 8,000x;,
Subject to Gx, + Ox, < 100
Qy +
where xpxy 20
(a) Solve the above LPP graphically
(b) Is there any multiple optimal solution? If yes, find them.
1,00,000
(Ans. Z=
Seanned wiek CamScanner
Operations Research