BIRLA INSTITUTE OF TECHNOLOGY AND SCIENCE-PILANI

Work-Integrated Learning Programme Division

FIRST SEMESTER 2014-2015
AAOC ZC222: OPTIMIZATION
Assignment - I
Q1. In BITS-Pilani, Hyderabad campus, computer center needs to schedule the staffing of the center. It is open from 8
A.M. until midnight. Lab in-charge has monitored the usage of the center at various times of the day, and determined that
the following number of computer staffs are required:
Time of Day Minimum Number of staffs required to be on duty
8 A.M.noon 4
Noon4 P.M. 8
4 P.M.8 P.M. 10
8 P.M.midnight 6
Two types of computer staffs can be hired: full-time and part-time. The full-time staffs work for 8 consecutive hours in
any of the following shifts: morning (8 A.M.4 P.M.), afternoon (noon8 P.M.), and evening (4 P.M.midnight). Full-
time consultants are paid $14 per hour. Part-time staffs can be hired to work any of the four shifts listed in the above table.
A part-time staff is eligible to work only one shift a day. Part-time staffs are paid $12 per hour. Lab in-charge would like
to determine how many full-time and how many part-time staffs should work each shift to meet the above requirements at
the minimum possible cost. Formulate a linear programming problem to assist the lab in-charge.

Q2. Solve the following LPP (if exists) graphically (sketch the feasible region clearly)
Maximize
1 2
4 z x x


Subject to
1 2 1 2 1 2 1 2 1 2
2, 4 4, 2 6, 6 4 24, , 0 x x x x x x x x x x
Q3. Solve the following LPP by simplex method
Maximize
1 2
4 z x x
Subject to
1 2
1 2
3 6
2 4
x x
x x



_
1
x

is unrestricted,
2
0 x
Q4. Consider the LPP
Minimize
1 2 3
2 3 2 z x x x
Subject to
1 2 3
1 2 3
1 2 3
4 2 8
3 2 2 6
, , 0
x x x
x x x
x x x

By letting
4
x and
5
x be the surplus variables and
1
R &
2
R are artificial variables respectively, the M-method yields the
following final table
BV Z
1
x
2
x
3
x
4
x
5
x
1
R
2
R
Sol
Z -1 M-0.5 M-0.5
2
x
0 0.3 -0.1
1
x
0 -0.2 0.4
Complete the above table.
Q5. Write the dual of the LPP
Minimize
1 2 3 4
3 2 z x x x x
Subject to
1 2 3 4
1 2 3 4
1 2 3 4
2 3 1
3
, , 0& is unrestricted
x x x x
x x x x
x x x x

*******