MING-I SIMPLEX METHOD &DUALIT

NG-Il(SIMPLEX
L I N E A RP R O G R A M M I N

METHOD & DUALITY)

DUAL of the given problem is as follows
h ya be dual variables 4-53
Let .
2, 250 h
= + 175 2 + 225 y3
finimize

the
Subject to th traints
+350 ya
5y1+ 2 t+ Oy3+ 7y4 290
8y1 +Oy2 + + 4ya 2 60

Shadow prices are: .0, 0, 5

Problem 4-24. Find the dual of the Jollowing
Minimize Z= 4x1 + 2x2 + 3xg
problem
Subject to the constraints
x +2x 23
X2-3x3 26
-X +3x2-2xg 3
X1, X2, X3 20

Solution. To write its dual, first multiply both sides of third constraint
by -1, so
that the primal can be written in the form:
Minimize Z = 4x1 + 2x2 + 3xg

Subject to the constraints

X 2x+0x3 23
3x3 26
Ox + X2-
X-3*2+2x3 2-3
X. 2, 3 20

Then the dual to the problem is written as:

Maximize 2, =3yi + 6y2 - 3ys

Subject to the constraints

+U3 S4
2y1 + 2 - 3y3 S 2
- 3y +2y3 3
1 . 2 , Ua20

Problem 4-25. Find the dual of:

Maximize Z 4x + X2 + 7Xg

Subject to the constraints

Xg 1 0
X +X2+
Y
5x X2 ++ X3 212

S4
X +7x2-3x3 20
X1, X2, X3
 454
Solution. Constratnt 1. It 1s in the form of an equation.
ype and
one ofs tynn eq
pair of inequallities;
mathematically,
can be represented by c a n be expressed
constraint
a
as: the othe
The given 'equality'
of2 type. + 3 S 100
X1 + 2
+ + X3 2 10 X2
X s by multiplying by_1
converted into type -1 on both
The second of these can again be
written as
sides. Thus it can be
-X-X2-x3 S-10
2. Therefore, we can convert
it into s type by multi
Constraint 2. This is of type lyn,
both sides by -I to get
S-12.
5x + *2-X3
modifled.
Constraint 3. Since this is of the type S, this need not be
Thus the primal problem is:

Maximize Z= 4x1 + 2+ 7X3

Subject to the constraints

X+ X2 + 10
-X -10
-5X1+ X2 - -12
X+7x2 -3xg S 4
X1, 2, X320
The corresponding dual problem is
Minimize Z =| 10yi 10y2 12y3 + 4y4
-

Subject to the constraintss

y1-2-5ys+ y424
y1- 2 + y3+ 7y42 1

1 -h Ua- 3y42 7
U1. 2, U3. y420
Problem 4-26. Find the dual
of the following problem:
Minimize Z 2x2 + 5x3
Subject to the constraints
X + X2 22
2x1 +X2 +6x 6
X - X2 + 3xg = 4

X1, X2, X320

Solution. The
equation x1 -

X+ 3xa = 4 can be
X1-2+ 3x3 4 expressed as a pair
X1-2 +3xg2 4 or -X1+2-3x32-4
X1 - 2 + 3xg 2 4
 a cOLlumn
ntil
in
that ontaining
sition and cross
have i
(cWe continue
een either these othe zero is found. 6-11
ofassig
nents.J assigned succe
or cross n which the We make an
btaine the optimmade is assignment wasassignment
equal to rows and columns made.
perform differen
tasks solution.
along withThetheirc rrive at Table 4. until all zeros
Since the number
re rows/columns
assignments of (i.e.. 4), we have
Tasks Subordinate
hours is as followssubordinates to
ABLE 4
A
I Man-hours Tasks
B II
8
Subordinates
A
TV

C 14 9
19 B 3
9 20
D V C 22
10 23
3
Total man-hours 4 = D
ce the 41 9 12 14
and the
aboveand departmental
the total inimum head should
man-hours assign the task to his
Droblem
r 6:4. _A certan required are 41. subordinates as given
chines.
tofive machines equupment
The estimated time (in needs five repair jobs which
repairjob is gwen inthe
following table hours) that each have to be
machine requires to assigned
Job complete the
Machine
J J2
J4 Js
M1 5
Ma 12
3 11
11 10
M3 8 5 4 6 9
M4 3 6 9 5
M5 6 7 5 11
Assuming that each mechanic can be assigned to only one job, determine the minimum
time assignment.
(Rajasthan Univ. M.Com., 2007)
Solution. Step 1: Select the Next, we select the minimum element
minimum element in each row and in each column and subtract this element
subtract this element from every from every element in that column. The
element in that row. The resultant resultant reduced matrix is shown in
reduced matrix is shown in Table 1. Table 2.
TABLE 2
TABLE 1
Job
Job J Ja Jsds
Machine Js Machine
4 2 4
2 0
M 2 3 6 M1 3 1
4 2 5
Ma 2 4 3 M2 1 3
5 4
Ma 5
M3 3 5 0
4 2 4
M4 M4 2 3 0 5
4 3 6 2 0
Ms M5
2 3 7
 DESPAIR
OPERATIONS RESEARCH CONCEPTS, ORPOR
6-12 AILEP

Step 2:Now we attempt to make a complete set of asei. ROBLEMS AND

zero element in each row
in the
or

cell
column.

{M1 .J2) and the

Since
row Mi contains
zero
ignments using,
assignment is made appear
is hesnge
out. Similarly, the assignment in
column is crossed
Ja
(M2 J) and the zero appearing
in the corresponding column.J is made Cortesy
has only single zero,
therefore the assignmen is
made Crosg
crossed
in cell
Ma
are two zeros in row Ms. we cannot make assignment in th
columnwise. we find that column Jj has only single zero, ther is TOw
assignment in cell (Ms .J ) and cross out the zero appearing in the cor
(Meforea.J3.weSinmake
Ms
Ms. The assignments so made are shown in Table 3.

TABLE 3
OrTespondlng
Job
Ji J J4 Js
Machine
M1 2 4 2 4

M2 2 5 3 1

M3 4 3
M4 4 3 5

M5 2 3 5

Thus, it is possible to make only four of the five necessary assignments using
zero element position. We, therefore, create one more zero element by
drawing te
minimum number of horizontal and vertical lines. Usually the minimum number
of lin
to cover all the zeros can be obtained by inspection. However, we shall use the meth
ghven earlier in explaining the various steps. The various steps for drawing the minimua
number of lines are
( Mark the row M3 which has no assignment
(b) Mark column J3 which has zero in the marked row Mg.
(c) Mark row M2 which has assignment in marked column J3.
Repeat steps (a) and (b) until no more rows or columns can be marked.
(e Draw the lines through unmarked rows and marked columns
The minimum number of lines drawn are shown in Table 4.
It must be checked tn
the number of lines drawn are
equal to the number of assignments made. But
require five assignments. To create one more zero, we examine the elements not
by these lines and select the smallest element, viz., 1 from cove
these among uncovered
TABLE 4
Job

Machine J Ja J4
M1
M2 2 5 3
M3 4 1 3

M4
M5 5
S I G N M E N TP R O DBLEN

TABLE 5
ASS

s m a l l e s t
element Job
Subtract
btract a l l t h e
this
u n c o
overed
elements
J J2 J3 JA Js
the
element where |Machine
irom
a n da d d
t w o

it l i
to
n e e s
intersect.
i n t e r s e c t .
The M1 2 a 5 2
t h e t w o l i n e s

obtained is
so
uced
matrix
matrix

adjoining
Table
Table 5.
5. M2 4 2
e deding
i n in
shown in usual way, the
M3
r e a

the
made are 3 2
ProceedaSsIgnments
m a o

ma

of 7able 5. M4 4 4
set in

M5
s h o w T n

2 4 5

optimal, solution is
the
Assign Job
To Machine Cost (Rs.)
Hence
Ja 5
M1 7
M2 Ja
6
M3 Ja
5
M4 Js
4
Ms J
Minimum total cost =Rs. 27
brands of packed
in manufacturing 5 its
6-5. ABC company is engaged each capable of manufacturing any of
Problem according to the
manufacturing setups, vary
snacks. It is having five brand on these setups
time. The cost to make a
brands, one at a

ollowingtable: S4 Ss
S2 Sa
S 5
11
7
4 6 9
B 6
3 6
Ba 5
8 11
B3 12
7
8
Ba 9 9
7 5 F
Bs five
brands are

resulting and Ss and ir

Sg,Sh
Assuming,
Find the
Pind
fve setups a r e S, S2,

assignment
products o n
these setups
of
Pumal

S
Solution. element
in B1
tep
each 1: Select the
m i n i m u m

from
ment Ba
this
Veow and subtract 1.
very ement in the row to get
Table
B
 20 12
HO
1/2 3/% 1/
220 4 /2 -1/2 1
20
1/2 5/8 -1/8 40
2400 30 15 45/4 15/4
C 2 51 3/4 -15/4
0 X1 60 1 -1/4 1/4 -1
60 -9/2 1/2
0 40 1 -5/4 -1/4 0 2
2600 30 20 35/2 5/2 0 10
Cr 2 -11/2 -5/2 -10
Since all C- 4 entries of the last table are zero or negative. optimal solution has
en obtained, and the maximum value of Z is 2600 which occurs when x = 60. x 40o
d xg = 0.

Problem 4.7. A famer has 1,000 acres of land on which he can grow com. wheat or
Jabeans. Each acre of corn costs Rs. 100 Jor preparation., requires 7 man-days of work
d yield a profit of Rs. 30. An acre of wheat cost Rs. 120 to prepare. requires 10 man-
ys of work and yields a profit of Rs. 40. An acre of soyabeans ost Rs. 70 to prepare
juires 8 man-days of work and yields a profit of Rs. 20. f the farmer has Rs. 1.00.000
preparation and can count on 8,000 man-days of work. how many acres shouldbe
ocated to each crop to maximize profit? (Jammu Univ. M.BA, 2006)
Solution. The appropriate mathematical formulation of the above problem is as
lows
Maximize Z= 30x1 + 40x2 + 20x3
Subject to the constraints
10x+ 12xn + 7x3s 10,000, 7x + 10x + 8x3 S 8.000
X + 2 + 3 1,000: X1. 2, X32 0

X. X and xg designate the acreage of corn, wheat and soyabeans respectively.

ere
2 0, S2 2 0 and s3 2 0 so as to
convert
ntroducing non-negative slack variables s
into equations, the given LP problem in its standard form
Constraint inequations
ecomes :
 4-26 OPERATIONS RESEARCH:CONCEPTS, PROBLEMS
Maxtmtze Z- 30x1 40 + 20x
+ +
0s + 0s + Oss
Subfeet to the constraints
10x+12x+ 7x + 8 = 10,0000
7A + 10x + 8xg + 8 = 8,000
At A t+ + 1,000
X. g X S1, S2, S 2 0
An initial
basle feastble solutlon Is:
X 0; S1= 10,000; S2 8,000, and
Starting with this solutton, the varlous sg =1,000
solution are shown below ; slmplex tableaux that leads to
SIMPLEX TABLEAU I, Il& 1I
C Basic Solutton 30 40 20 0
C variables vahues
0
0
S
S2 Sg
Minratioimurn
S
10,000 10 7
0
S2 8,000
0
7
8
1
10,000/12
1000 1 2 800
Aenters
and sa leavesC-2 30
40 1 20
1
1000
0 0
S 400
40 16/10 -26/10
0 800 7/10 -12/10
S3 200 8/10 0 250
X enters 3/10 0 1/10
C-2 2/10 8000/7
and s, leaves 16 0 -1/10 1
4 2000/3
30 -2
250
40 0
625 -26/16 10/16 -12/16
1 0
125 31/16 -7/16 10/16
0
-2 11/16-3/16 1/8
1/8
0
Since all the entries in -35/4 -5/4
the -5/2
solution to the C-Zy row are either
given LP problem
Sovabeans are 250, 625 and O has been obtained.egative
Hence
or
zero, the
32.500 respectively order to achieve
in acreage optimal feasible
for corn,
.

Problem 4.8. A factory a

maximum rne wheat and
products are Rs. produces three products A, B, C. The
X. Y, Z and time 3, 4 and 6 respectively.
profit of Rs.
The
(in hours) products are processed
required in each operation profits per unit of those
for each unit is in thre
Operations given helperations
Product w:
A
X B
4 C
Y
5 3 6
Z
2
 42
n
m i ti
iaal
i
540
are shown
below arn
made to the cells
allocations
various
the
h u st h e
as
follows:
tollows

solution
is

ble Destnations

Supply
D D3
D
14 8 Total transportation cost
15 x6
= 15 x 4 +6 x6+ 18 4
12 x 14+ 42 x
(15 +9 x8 +
6 2 = Rs. 612.
24
(18
10
14
21
12
2 12
42
(42
O
54 102
27
Demand
21
transportation problem by
solution of the following
Find initial feasible
Problem 5-4.
orth-West corner Rule
Destination

R T Supply
To P 9
From 13
6 8 50
A
4
10 8
70
B
13 11
10 13
30
C
14 4
8
9 11 13 50
D
200
105 20 200
Demand 40 35
2007
Delhi Univ. B.Com. (Hons.),
 2
OPERATIONS RESEARCH: NCEPTS, PROBLEMS
initial feasible
is solution of. AND
Step 1: To find
min (s. d) mir proble
dustng mNe
Solution. the =
and allocate
t with
the

es a balance
cells (A, )

-cate 40 units to
this

(50- 40)
of
we move
cell
=
which completely exhausts da

10 units of

horizontaly to the
supply at source A.
next cell in the
40)
of
Of emand
sen
40.destTihernatloenln
des
p
th min col n and
scolumn
Step 2: Next,
the largest allocation possible is
d
ie. (A. 9). At this stage, - 10, dd
,

35) = 10. This

allocation of 10 units to the cell (A. 9) completely
Satisfes. tely satisfles10
a balance of (35 10) 25 units hes
-

However, this leaves of

ource A.
ination B. deman
Step 3:Now we move again vertically Since the
(B, G). Since
to the cell the supply
destination
rce B is 70 units and demand ofThe 9is 35 units, min 2alb
the min
(70, 35 dlea
avallahl,
requirement of destination g 0ie35
s 5
s are (B, 9).
allocated to the cell is now
a balance of (35 10) 25 units of supply remain at source B. Movn
Moving
izontally, we allocate 45 units to the cell (B, R)which completely exhausts the sag
iestination Qand leaves a balance of 60 units demand at destination R Supph
Step 4: Further, we move vertically downward to the cell (C, R). At this cell,
required at destination Rand 30 units are available at source C. So we alloaa
ts to this cell (C, R. Finally, we allocate 30 units to cell (D, R) and 20 unitscateto a30
T) to meet the rim requirements.
It may be noted here that there are 7 (4 +4 1) allocations which are
necessary t
ceed further.
The initial feasible solutions is shown
below. (Arrows simply represent the order in
ch the variables have been
selected.
INITIAL SOLUTION-NW CORNER METHOD
Destination
To
From P
R T Supply
A 4

40 8 13
10)
B 13 10
25 45) 70 6 0
C 14
10
(30)
13 30
D 9
50
Demand
20
40 05 60
20 0 20 200
al cost =4 x 40 200
+ 6x 10 + 11 x 25+ 10 x 45 + 10x 30 + 13 x 30 +8 x20 =1795
 TPAKGIATA
OPEHATONa

wudemtles
em.
Hwhlem
a10 A
Cuslom

17
4

tn equal ta d
total supply the al
DArehouen

lreanapolallon cOsis
demnd
C niently,
2 Y e hlowtng
table gtves the
per init
shiprend
cuNtomer
ANPoN48e to exaVi

Determtne what supplies to des

Werearse 5 Jrom each of the warehonses t e
8
Customer so as to minimize on
5 transportatton cost.
6 2
9
3
8 3
[B.H. Univ. M.Com.,2

Method (VAM), an initial basic feaste

Solution. Step 1. Using Vogel's Approxtimatlon is obtained:
solution of the above as displayed in the following table
problem
TABLE 1: INITIAL FEASIBLE SOLUTION-VAM
Customer
Warehouse Supply Row penalties
1 2 3 4

3 6 8 5 20
5 2 2 2
15 5

6
2 5 25
3 1
9
19

7 8 3 9 7
3
13 4
4 4 2
Demand 18 65

3
Column 5
penalties 3

3 0
RANSPORA74 A.

S e p2
Sep
2.
This
solution is again
TABLE 2 reproduced
INITIAL FEASIBLE Table
in
2 for 5-27
ready reference.
Warehouse
1
3
2
Customer
3
SOLUTIONOPTIMAL
6 A
8 Supply Row number
(15) 5
5
9 20
6 1 = 0
2
2 19 5

3
7
3 (9) 28
u 0
8 3
3 9
13 4
3 17
=4

Demand 15 19 13
18 65
Column U = 3
number, uj Ug-1 U4= 5

In Table 2, the number of

occupied cells are m + n - 1, i.e., 3 + 4 1 =6, and
allocations are independent and initial solution is
non-degenerate. Thus an optimal
solution can be obtained. The total transportation cost
associated with this solution is
3x 15 + 5x 5 + 1x 19+5 x9 + 3x 13 + 9x4 =Rs. 209.
3. In
Step order to calculate the values of us (i
each occupied cell, we arbitrarily assign uj = 0
=
1, 2. 3) and 1. 2. 3. 4) for
vjs
to simplify calculations. Given
=

4 0, v and va can be computed immediately by

=
using the relation cy 4 + tor s

Occupied cells as shown below:

U] = 3
C11 U 1 + U1 3 0 + V1 or

V4 5
C14 1+ U4 5 0 + V4 Or

also be calculated a s shown below

a , U2 and ua
Can
: Uj and va, value of u»,
24 u2+ V4 5 =
u2 + 5 or
ug = 4
5 or
C34 u3 + V4
1
9
= 0
us+ +V2 or
U2 1
C22 u2 + V2 U'g=-1l
3 3 4 + U3 or usi=
C33 u3 + U3 cell is
determined by
unoccupied
the
for each of
Step 4. The
ne op
Opportunity
cost below : =9
(0 1)1)
shown ="
the relati
the relation: Ay
= Cy-(uj U)
+ and is
5:A13
=
{u1+
C13 -(U
Ci3
+ U
Ug)= =
88--(0-
1) = 2-(0
2 - ( 0-- 1)
1) =

6 - (0 + U)
C23-(u2 + U)
=
+

12C12
U2)
-

(u1 +
=
3;A23 C23-(u2
=
1)
+ 1) ==

)= 8 -(4+
8-(4
=

6 (0+3) + ) =

A21 = C21
21C21
v)
(u2 + U1)
(uz --
=

0; As2 C32 -(u3+

C32-(ug
=

7 -(4 3)
=
transporta
minimizing
C31-(u3 + U)
=
for cost of
31 criterion
opportunity
costs
the
optimality since probler
to the one,
solution to the given
is optimal
A c c o r d i n g

T h e optimal
o h u t i o n

Rrobi
 TONG E G A O GONOL
12-18 LEMB
EMB AND
ROBLEN 8OLUTIONS
AND 8OLU
Actev mmediate predecessor actutty
Duratton (days
10
A
1
A
B. C
C,D
E,

Solution. The network is drawn as follows

B ( 5

E6)E(6)
GA1O2C ) G7
D0)
DI)
***
Dat0) F ( 4 )
6

Fig. 12-15:Network diagram

Various paths Duration of paths (days)
(0 1-2-4-6-7 10+5+6+7 28
( 1-2-3-4-6-7 10+4+0+6+ 7 27
(i 1-2-3-5-6-7 10+4+0+4+ 7 = 25
(w) 1-2-5-6-7 107+ 4+ 7 28
Critical paths are 1 -2-4 6-7 and l-2-5-6-7 with duration of 28 days and
are marked with double lines.
Problem 12.10. The following table gives the activities in a construction project and
other relevant information.
Activities 1-2 1-3 2-3
2-4 3-4 4-5
Duration 20
:
25e
( Draw the network Jor the project, (i)
10 12 6 10

time, (iiy Indicate the critical

Compute earliest event tëme and latesteuent
path and total project duration, (iv) Find total, Jree
and independent float for each activity, and (u) Which are the critical activities ?
Solution. (i) The network diagram is as follows

20
12
10
10
25 6

Fig. 12-16: Network diagram

 12-19

eariest stat me and ienhest Snish me r each acthty. proced

Far Pass Merod Barkurd pass Mechd

E =E = 0 -20 =20 L l -4s 46-10 - S

L=Le = 6- 6 = 0

O 25 = 30
= Tat D - I

Taz 2 - 1 2 30-6= 6 n 6 - 12. 30- 10- 20

=

E - 4=36- 10 =6 L -4:4-
3 0 - B 20-20 0

Se u e r et These nahues are shoun in the loun right

se esc e shoun n nodel
oc ecieDetoie portion ofeach enent

212

1 2 - 1 7 : Netnork diagr
Fig.
Fig. 12-16. is the longest time path
shown by double lines in the a r e equal to
the L
The critical path E-values
network path I - 2 - 3 -4-5. where be completed exacty
trrougnout the no spare (slack)
time and the events must

values. Thus, there is

46 days.
as scheduled to meet completion time of
OF TIME ESTIMATES
TABLE 1:COMPUTATION Latest tine
Earliest tine
Start Finish
Finish
Duratiorn
Start
Activity -
E E+ (6)
(4) 5)
(2) (3) 20 2 0 = 0 20
(1) 0 20 20
0 30 2 5 = 5 30
1-2 20
025 25
25 30
1-3 20+10=30 30 - 10 20
10
20 36
2-3
20 12= 32 36 12=24
20 36
2-4 12 30+6 36 36 6 30
30 36 46
10
3 4
36
3 6 1 0 = 46 46 =

4 5 10
 12-20 OPERATIONS RESEARCH: CONCEPTS, PROBLEMS AIn
(iv) TABLE 2: COMPUTATION OF TOTAL, FREE AND INDEPENDENT FLOATO
SOLUTIONS
Activity Duration Total float Free float

1 -2 20
LS- ES Total float Head slack =
Independent float
Free Jloat
0-0 0 0 0 =0
-

Tail slack
1 - 3
25 5-0= 5 5-0 5
2 3
2 4
10 20 2 0 =0 0-0 0 5-0 5
12 24 20 = 4 | 4-0 4 0-0 0
3 4 6 30 30= 0 0-0 = 0 4 0 4
4 5 10
36 36 =0 0-0 0 0-0 0
0-0 0
() Critical activities are 1 -

2. 2 3 , 3 4, 4- 5
-

Problem 12-11. For the

following PERT diagram:

2 D 3
4

4
9

5 G 6
4
( Compute earliest event time and latest event time.
( Critical path and total project duration.
(iin Total. free and
independent float for each activity.
Solution. To determine earliest
start time, E and latest finish time,
activity, proceed as follows: L for eaci
Forward Pass Method
E = 0 Backward Pass Method

E2 E +t1,2 =0 + 3 3 Lg Eg = 15

E3 E 2+ t2.3 3+ 4 7 Lg Lg- t 8,9 15 3 12

=
-

L7= Lg-t 7,8 l12 5 7

E4 = E1 +t1,4 =0 +2 2
Le Lg t 6,9 l5 6 9
= -

Es= E+ti,5 =0+2 2 =

-

L5 L6-t 5,6 9-4 5

E6 max { E 4 + t 4,6: E
max
5+t5,6
{2 + 7, 2 + 4} =9
L4 min { L6- t 4,6:
=

Ly - t 4,7
E7= E4+ t4,7 2 +4 6
=
min {9-7;7 - 4} =2
 12-36
OPERATIONS RESEARCH CONCEPTS, PROBLEMs AND
AND SOLUTIONS
B 2 5
E 14
C 2 5
F
D. E 3 6
G
15
H F.G 2
3
a Draw the PERT network and firnd out the expected project completion tüme
(i0 What duration will have 95% confidence for project completion ?
(ti If the average duration for activity F increases to 14 days, what wll be its
on the expected project completion time which will have 95% confidence ? effect
(For standard normal Z = 1645, area under the standard normal curve from 0 to 7
0.45) (CAFina), May 1996)
Solution. The network diagram for the given data is shown in Fig. 12-30.
A(2) D(1)
1B4) 3E(6) 5G7)6 H2
O19 44 919
C3) F(5)
312
Fig. 12-30: Network diagram
Actwity 1 - 2 1-3 4 2-5 3-5 4 6 5-6 6-7
2 2 3
to
4 2 5
m
14 15
tp
3 6 7
telto+4tm+ (p
2-1tp tP (1/6)2 1 (2/E
The expected duration and variance for each activity is shown in the above table.
The critical path is: 1-3-5-6-7 or B E - G-H.
S.D. of project length, o = N1+4+4 +0-108 = V9.108 = 3-02
(i) Since P(Z 1-645) =0-5+0.45 or 0-95.
= 1-645 or3-021-645
Thus T = 19+ 1-645 x 3-02 = 24 days.
Hence 24 days of project completion time will have 95% confidence.
the
(ii When the average duration of activity F increases to 14 then
C - F-H also becomes critical. Now
S.D. of new project length = V9.108+ 2 = 3-35
 S
nt 0. also ntingtwo larch 2007
shop has +S0as budeted
st 24 square requires
tor a operators andpresses, of which there are
operators.
nduction. t is of maximum
meires Ol two
operatorsoccupies
availamexpend. perators ples 20
expenditure
20 sou ere are
square metres
gven that
n e n that proposed
POposed t
to
Write downtype A can printbuy
available
a
but
floor space, on these occupies 30 squa
it
all the combination of presses
150 sheets and work presses of Rs.
must
X and Y be provided
are
120.000.
conditions. The labour per minute

((
draw a
use the
conditions
graph represent this
to
equations/inequalities
are which
and type
given by 2x+ 2y2represent
Y.
that
300 per will
lor
at
maximize
minute.
the cost
graph to find problem. 24. and space
achieve its the shading
number any unwanted
() state the objective of maximum of presses X and Y regions.
figure of production, the
Hint.
Maximize Z 150 maximum
x, 300
+ production and
and
the total cost
company should buy to
Subject to the constraints x of the
presses in this case.
X * *2 212

x, +
3x 30
1 8 X presses2x+3x and 4 Y
48 X.*20
D) Maximum presses should be bought.
production
Total cost of
is
150(18) + 30014) =3900
3-15. A farmer has a
presses 18(4000)+ 4(12000) Rs. sheets/minute.
=

1,20.000.
acid and supply
of chemical
phosphoric
ter testing the soil
fertilizer
Type II fertilizer which of Type I
which contains
conditions of contains 5% 10% nitrogen
hosphoric acid is a field, it is nitrozen and 10%
found that at least and
costs Rs. 3 required for a
good crop. The fertilizer 14 kg of phosphoric acid.
per kg. How Type I costs Rs. 2 nitrogen and 14 kg ol
many
equirement and the cost be minimumkilograms of each fertilizer per. kg. and the
? (Use should be used to meetType
Hint. Minimize Z =2x, +3x graphic method) (Jiwaji Univ. M.B.A., the
March 2010)
Subject to the constraints
2x, +x 2 280. 3x, + 5x
2 700: x.x220
Ans, x 100. x =
80 and min Z= Rs. 440
316. A finished
product must
amufácturing the product are A withweight exactly
a cost of Rs. 2
150 gm. The two raw
per
materials used in
unit and B with a cost of Rs. 8
t least 14 unitsof B and not more than 20 units of per unit.
and 10 gm A must be used. Each unit of A
and B weigh
respectively.
nal product to minimize
How much of each type of raw material should
be used for each unit of
the cost. Solve graphically.
Hint. Minimize Z =2x, +8x
Subject to the constraints
5x, 10x = 150. x, s 20. xz2 14 :x. xz20
Ans. x, = 2. x = 14 and min Z = Rs. 116

1 7 . A factory produces two products X and Y each of which must pass through two
roduction processes A and B. Product X requires 10 hours in A and 8 hours in B, while product
requires 10 hours in A and 3 hours in B. The maximum capacity of process A for a certain
eriod is 12000 hours and, due to cost and manpower agreements. process B must be used for at
 18 S produc
uinent constituents
necessylvito
to bu
IN
product ns) in
or
kirement of
onstituents
08
S
2
0
The plant can run for
20
erated for more than
120 hours
. 24 per itre
80 hours per per week in
week. The tota 230
FORMULATE respectively. selling prices
termine lineara
how the
plant programming
should model. using
Minimize (Total be operated
Flint.
each week. graphic method a
Selling price profit)
Z
=
(GGSIP
= QOperating cost
{(15x 18) + (20 Cost of raw
materials
+{(20x 18) + x 24) (500 +20 x 5 + 10x 8))}x
-
70x + 60x(10x 24) -(23030x 5 +20 x8) x
Subject to the constraints
20 x+ 30 x 2700. 10 x, +
20 x 2000. x 80. x +
and
where decision variables X220 x< 120
2 respectively. x and x denote the number of hours the plant
Ans. operae in process l and process
x 120, x 0 and max Z= 8400.
=
=
3-24. An
each first class
aeroplane can carry a maximum of 200
ticket and a profit of Rs. 300 is madepassengers. A prolit of Rs. 400 is made on
reservesS at on each
least 20 tickets for first class seats. However, at least economy class ticket. The airline
preier to travel by economy class as to the first class. Determine how
4 times as
many passengers
must be sold in order to maximize the total many tickets of each type
profit for the airline.
Formulate a linear programming model to determine the
profit. Solve it by graphic method. optimal mix that will maximize
(M.D. Univ. M.B.A., Nov. 2010)
Hint. Maximize Z 400 x, + 300 x
=
Subject to the constraints
X+ 200. x 2 20, x2 4x, : X, x,20
Ans. x = 40. x = 160 and max Z = Rs. 64.000