Assignment Problems for Kolkata Center

Date of submission: Saturday, April 12, 2014

1/6


Problem 1
A company manufactures four products (1, 2, 3, and 4) on two machines (X and Y). The time
(in minutes) to process one unit of each product on each machine is shown below:
Machine
X Y
Product
1 10 27
2 12 19
3 13 33
4 8 23
The profit per unit for each product (1, 2, 3, and 4) is 10, 12, 17 and 8 respectively.
Product 1 must be produced on both machines X and Y but products 2, 3 and 4 can be
produced on either machine.
The factory is very small and this means that floor space is very limited. Only one week's
production is stored in 50 square metres of floor space where the floor space taken up by each
product is 0.1, 0.15, 0.5 and 0.05 (square meters) for products 1, 2, 3 and 4 respectively.
Customer requirements mean that the amount of product 3 produced should be related to the
amount of product 2 produced. Over a week approximately twice as many units of product 2
should be produced as product 3.
Machine X is out of action (for maintenance/because of breakdown) 5% of the time and
machine Y 7% of the time.
Assuming a working week 35 hours long formulate the problem of how to manufacture these
products as a linear program.


Problem 2
(a) Consider the following problem, where the value of k has not yet been ascertained.
Maximize Z = x
1
+ 2x
2
,

0 , 0
0 , 3 2
3
2
2 1
2 1
2
2 1
> >
> + s +
s
s +
x x
and
k where k x kx
x
x x
to subject


The solution currently being used is x
1
= 2, x
2
= 3. Use graphical analysis to
determine the values of k such that this solution actually is optimal.






Assignment Problems for Kolkata Center
Date of submission: Saturday, April 12, 2014
2/6

(b) Consider the following problem.

Maximize Z = 5x
1
+ 3x
2
+ 4x
3
,

0 , 0 , 0
30 2 3x
20 2

3 2 1
3 2 1
3 2 1
> > >
s + +
s + +
x x x
and
x x
x x x
to subject


You are given the information that the nonzero variables in the optimal solution are x
2

and x
3
.

(a) Describe how you can use this information to adapt the simplex method to solve this
problem in the minimum possible number of iterations (when you start from the usual
initial Basic Feasible solution). Do not actually perform any iterations.

(b) Use the procedure developed in part (a) to solve this problem.


Problem 3

(a) Consider the following linear program expressed in the standard form:

Maximize z = 3x
1
+ 2x
2
+ 5x
3


0 ..., , , x
20 x 4x x
60 x 2 3
30 x x 2
:
6 2 1
6 2 1
5 3 1
4 3 2 1
>
= + +
= + +
= + + +
x x
x x
x x
to Subject


The following matrices represent the inverses and their corresponding basic variables
associated with different simplex iterations of the problem. Compute the associated
constraint equations of each iteration and determine the corresponding basic variables
and their values.

(i)
|
|
|
|
|
|
|
.
|

\
|

1 0 0
0
2
1
0
0
2
1
1
); , , (
6 3 4
x x x
Assignment Problems for Kolkata Center
Date of submission: Saturday, April 12, 2014
3/6

(ii)
|
|
|
|
|
|
|
.
|

\
|

2
1

2
1
1
4
3

4
1
-
2
3
8
1

8
1

4
1
); , , (
1 3 2
x x x
(iii)
|
|
|
|
|
|
|
.
|

\
|

1 1 2
0
2
1
0
0
4
1

2
1
); , , (
6 3 2
x x x

(b) Consider the following linear program expressed in the standard form:

Maximize z = 2x
1
+ x
2


0 , x , , , x
3 2 x
6 x 3 4
3 x 3
:
5 4 3 2 1
5 2 1
4 2 1
3 2 1
>
= + +
= +
= +
x x x
x x
x x
x x
to Subject


(i) Compute the entire simplex tableau associated with the following inverse matrix
using the primal-dual relationships.
( )
|
|
|
|
|
|
|
.
|

\
|

= =
1 1 1
0
5
3

5
4
0
5
1

5
3
: , , var
5 2 1
inverse x x x iables basic
(ii) Determine whether the iteration in part (a) is optimal and feasible.

Problem 4

(a) The hospital administrator at St. Charles General must appoint head nurses to four newly
established departments: urology, cardiology, orthopaedics, and obstetrics. In anticipation
of this staffing problem, she had hired four nurses: Hawkins, Condriac, Bardot and
Hoolihan. The administrator has interviewed each nurse, considered his or her
personality, background, and talents, and developed a cost scale ranging from 0 to 100 to
be used in the assignment. For instance, a 0 to nurse Bardot assigned to the cardiology
implies that she would be perfectly suited to that task. Which nurse should be assigned to
which unit?

Assignment Problems for Kolkata Center
Date of submission: Saturday, April 12, 2014
4/6

Department
Nurse Urology Cardiology Orthopaedics Obstetrics
Hawkins 28 18 15 75
Condriac 32 48 23 38
Bardot 51 36 24 36
Hoolihan 25 38 55 12

(b) A Company has four factories situated in different locations in the country and four sales
agencies located in four other locations in the country. The shipping cost (/unit), cost of
production (/unit), and monthly factory capacities are given below:

Sales Agency Monthly
Capacity
(units)
Cost of
Production Factory 1 2 3 4
A 7 5 6 4 10 10
B 3 5 4 2 15 15
C 4 6 4 5 20 16
D 8 7 6 5 15 15

Monthly requirements and the sales price (/unit) of Sales Agencies are as follows:


Sales Agency
1 2 3 4
Monthly
Requirements (units)
7 5 6 4
Sales Price () 3 5 4 2

Find the monthly production and distribution schedule that will maximize profit.

Problem 5

(a) Consider the following LP:
Max z = 5x
1
+ 2x
2
+ 3x
3

s.t. x
1
+ 5x
2
+ 2x
3
= 30
x
1
- 5x
2
- +6x
3
40
x
1
, x
2
, x
3
0
The optimal solution yields the following z-row:

x
1
x
2
x
3
x
4
x
5
Solution
z 0 23 7 5+M 0 150

Where, artificial x
4
and slack x
5
are the starting basic variables.

a. Write the associated dual problem
b. Determine the dual optimal solution from the optimal z-equation


Assignment Problems for Kolkata Center
Date of submission: Saturday, April 12, 2014
5/6

(b) HiDec produces two models of electronic gadgets that use resistors, capacitors, and
chips. The table below summarizes the data of the situation.
Resource Model 1 Model 2
Maximum
Availability
Resistor 2 3 1200
Capacitor 2 1 1000
Chips 0 4 800
Unit profit ($) 3 4

Let x
1
and x
2
be the amounts produced of Models 1 and 2, respectively. Following are
the LP model and its associated optimal tableau:

Formulation

Optimal simplex tableau
Maximize z = 3x
1
+ 4x
2

Subject to:
2x
1
+ 3x
2
1200 (Resistors)
2x
1
+ x
2
1000 (Capacitors)
4x
2
800 (Chips)
x
1
, x
2
0
Basic

x
1


x
2


s
1


s
2


s
3


Solution

z 0 0 5/4 0 1750
x
1
1 0 -1/4 0 450
s
3
0 0 -2 2 1 400
x
2
0 1 1/2 -1/2 0 100

a. In terms of optimal profit, determine the worth of one resistor, one capacitor and one
chip.
b. If the number of resistors is increased to 1300 units, find the new optimum solution

Problem 5
The Fast Shop Market has a single checkout counter and one employee to serve customers.
An average of 24 customers arrives each hour with a Poisson distribution (and therefore,
exponentially distributed inter-arrival times). Customer checkout times are exponentially
distributed with a mean of 2 minutes. Customers are checked out according to their order
line.
(a) Calculate the average length of the checkout line and the average time (minutes) that
customers spend waiting in line prior to checkout.
(b) The owner of Fast Shop is considering adding a bagger to speed up the checkout
process. Experiments show that 40 customers can be served per hour with a bagger
(exponentially distributed). Recalculate the average length of the checkout line and the
average time (minutes) that customers spend waiting in queue for service.
(c) The bagger will cost the store employee $300 per week. The national office has done
research that indicates that for each additional minute the average customer waits in line
costs a Fast Shop store $150 per week in lost sales. Is the bagger worth her/his wages?
Show your work.
(d) Suppose that Fast Shop finds that in addition to reducing mean processing times, the use
of a bagger also reduces the standard deviation of checkout times by 50%. By what
percent will customer in-line waiting times be reduced?

Problem 6
(a) The Boulder City Council has decided to construct a series of bicycle paths in the city to
connect neighbourhoods not currently served with paths. The neighbourhoods and the
prospective paths connecting them are shown below. The cost of constructing each path
($100,000) is also shown. Determine a plan that will connect all 9 neighbourhoods at a
minimum cost to the city.
Assignment Problems for Kolkata Center
Date of submission: Saturday, April 12, 2014
6/6





















(b) A network consists of Node set {1, 2, 3, 4}. The node capacities (b
i
s) are b
1
= 8 for node
1, b
2
= 6 for node 2, b
3
= - 3 for node 3, and b
4
= -11 for node 4 respectively. The arc set
for this network is: {(1 2), (1 3), (2 3), (2 4), (3 4)}. The corresponding c
ij
values
of the arcs are: c
12
= 2, c
13
= 6, c
23
= 1, c
24
= 5 and c
34
= 2.

(i) Draw the network diagram.
(ii) Write the linear programming problem corresponding to this network flow problem.
(iii) Using x12, x13, and x24 as part of a starting basis, solve this problem by the network
simplex method.

1
4
6
7
3
2 5
8
9
3
6
2
7
2 5
6
5
8
9
3 7
2
1
4
4