Problem

13. Linear Programming

C. 1.Ganesh
Ex. Activities. wants to plan his diet to fulfill his requirements of fats, proteins
lats, proteins
lable and

Two dietplans
are available and
minimum cost.
at the diet plans
arbohydrates
information
about these
tne following table gives
Per Unit
Units Cost (Rs.)
Diet 16000
Proteins Carbohydrates

Plan Fats
60
8
3 4
I 50
5
2 3
II 230
88 120
Minimumn
Requirement and obtain the
problem
programming
as a linear
Formulate the problem
optimum solution.
the number of units
of units of diet I and y be
Solution. Let xbe the number
of diet II that Ganesh
consumes.

subject to
The problem is to minimize z
=

|60x +|50 y
x 2 y 2 88 (1)
x 3 y 2 1 20 (2)
8x y2 230 (3)
(4)
x20
(5)
y20
complete the
of the feasibleregion. Find the vertices and
Draw graph
following table. (Please see Page 62)
 Sole
Oxand Yolxs

Koa)

epstbie. po

10 20 40 S0
120
3 426

61
 Lines through vertex Value of z
Vertex
(1) (2) 140
D(24-8)
() (3) 1900
C-14
E30O (2) (4) 100
A -461) (3) (5) 2.300
(5) 0
(0,0) (4)
Ex.2. Afirm
manufactures products oftwo types Pl and P2.The
The per
per unit proi.
are Rs. 3 Pl and Rs. 4 on P2. Every product is processed on t
on
profit
tw
machinesA and B. P1 requires 2 minutes of processing t1me on machie
A and 3 minutes on B. P2 requires 3 minutes on A and 2 minutes onhne
Machine A is available for 7 hours and 30 minutes while
available for 8 hours and 30 minutes during a working
machine B
the problem as a
day. Formult
linear programming problem and solve it.
Solution: Let x be the number of units of Pl and be
P2 y the number of units of
produced. Then the problem isto
Maximize z= 3x + 4y subject to
x+3ys 450 (1)
3x 2ys 510
(2)
x20
(3)
y20
(4)
Draw the graph of the feasible
see Page 64)
region. Complete the following table. (Pleo*
oo

balisisiO 43 u
 Lines through vertex
Value of z

Vertex
(1)
(2) 642
8(h6.66 (3) 600
(1)
AOI50) (4) 51o
(2)
C(oo (5)
(3)
0
(4) (5)
(0,0)
B.
Solve the Following Problem graphically:
Linear Programming
o e the following
Maximize Z 2x +3y
X+ys1, 3x + y s 4, x 20, y 20.

..

3M 4
************ *****

7
...

*** ***********

OA easble
leYeaON
A.(0,1) Z 2 3 . Z2 (o)4 3(1) 3 A ************************* ************

B1,0.)Z2.3 (o)=2 '** ****************

O(o) Z 2o)43(0) 0
****************************************

Mox Z 3 ** ******* *

..m.a.x.m.u. A )

******* ***** * * * * * * *

**

,
 ( a

3A4
 Problem graphically:
Q.2. Solve the following Linear Programming

Minimize Z=4x+2y
20.
XtY227, x +y221, x +2y 230, x 20, y
* * ***

3 21. ******

9 O21 30P
70o d2 *********

Shaded..Yeaon...fhe.eas1hle.xR940.
************
********
***

******
A(0,27 Z4(o).13ea) 0154S4
* *** * * * * *

B(318) 7 4 (3) 2(18) =12 436 48 **** *********************q 3 *** * * *

************* ,
*****

66
c(1 Z 4(12) +210)= u2 +18
********" *****'**** **
=
***********

****

D200). 430) 4 2(0) =20 4 0 ***************

= t20
*************

********

S minn ot B318 **************************************** ****'******

Mi 43. ***

****
***

******
********* ** **

* *

********

66X =
 ble Tegion
(o
(,1
X
20 30 40 So 60

3x 7
 Q.3. Acarpentermakes chairs and tables. Profits are 140/-perchairand 2 1a
per table. Both products are processed on three machines: Assemblin
Finishing and Polishing. The time required for each product (in hours) a
total time available in hours for each machine are as follows: and
Chair Table Available time
Assembling machine 3 3 36

Finishing machine 2 50

Polishing machine 2 6 60

Find the number of chairs and tables to be made so as to get maximum

profit.

Lethe.numbe...c.haxk ******OndLablu ******.

****'**** *******
149percha:x Ond
*************************.
210
pe.x..able * * * a ********. .

Max = 4 0+ 2 0 y
***

Su.b.. . 3 y 3 * ******

.5M2y 59 * * * * ' * ° * * * *

**********

*** 27
***********'*** 6. 0.. ******

***
***

3 y. . 5 + 2y 50 2
******* ***"* * ************
************************
660
kdaa************

O12
AtAMeleivduhurddha" ***** *9V
.lo
awAAPMIR *********
030
&12 25 o loo
Vyw*w*»**we*vTThr****sto*

Shadedxg00.Aec.. e4ble. on.

A19)=49(o).11o010)10u **************************

B.3,1) 40(3) 4 D(4)= 420 + 1890 2310

40(26) 4RI0(10) =1213.33 +00 **** **** * * * # p * * 4**"

.M.aXIm.m. ***o5# * Pa***

************

Max Z 2310
madu
AnS 3 Chairs Ond tables shuld be
to moxim2e the 68 ht.
 20

12
(oy-too
A

C30,0 X

4 So
t2yesB43H 36
Sign of Teacher:

69