Академический Документы
Профессиональный Документы
Культура Документы
PART - A
Subject to Constraints
..
..
..
am1x1 + am2x2 + am3x3 + . + amn xn bm
and non-negativity restrictions x1 , x2, x3 xn 0
This form of LPP is called Canonical form of LPP. In matrix notation the
Canonical form of LPP can be expressed as
PART-B
(1) A firm produces 3 products. These products are processed on 3 different machines.
The time required to manufacture one unit of each of the 3 products and the daily
capacity of the 3 machines are given below:
Cost of the various raw materials per unit ton are: Rs.90 for A, Rs.280 for B and
Rs.40 for C. Find the proportions in which A,B and C be used to obtain an alloy of
desired properties while the cost of raw materials is minimum.
Solution: Minimize Z = 90x1 + 280x2 + 40x3
Sub to
0.92x1 + 0.97x2 +1.04x3 0.98
7x1 + 13x2 +16x3 8
440x1 +490x2 +480x3 450 & x1, x2, x3 0
(3)ABC manufacturing company can make 2 products P1 and P2.Each of the product
require time on a cutting machine and a finishing machine relevant data are
Product
P1 P2
Cutting
hrs (per
unit) 2 1
Finishing
hrs (per
unit) 3 3
Profit
9per
unit) Rs.6 Rs.4
Max.
sales
(per
week) - 210
The number of cutting hours available per week is 390 and the number of finishing hours
available per week is 810.How much of each product should be produce in order to
maximize the profit ? Nov/Dec 2003
Solution: Max Z = 6x1 +4x2
Sub to
2x1 +x2 390
3x1 + 3x2 810 & x1, x2 0
(4)Old hens can be bought at Rs.2 each and young ones at Rs.5 each. The old hens lay 3
eggs per week and the young ones lay 5eggs per week, each egg being worth 30 paise. A
hen costs Rs.1 per week to feed. A person has only Rs.80 to spend for hens. How many of
each kind should he buy to give a profit of more than Rs.6 per week, assuming that he
cannot house more than 20 hens. Formulate this as a L.P.P.
Solution: Max Z = 0.5 x2 0.1x1
Sub to
2x1 + 5x2 80
x1 + x2 20
0.5x2 0.1x1 6 & x1, x2 0
(5) A television company operates 2 assembly sections, section A and section B. Each
section is used to assemble the components of 3 types of televisions : Colour, standard
and Economy. The expected daily production on each section is as follows :
(6) An electronics company produces three types of parts for automatic washing machine.
It purchases costing of the parts from a local foundry and then finishes the part of
drilling, shaping and polishing machines.
The selling prices of parts A,B and C respectively are Rs. 8,Rs.10 and Rs.14.All parts
made can be sold.Casing for parts A,B and C respectively cost Rs.5,RS.6 and
Rs.10.The shop possesses only one of each type of machine. Costs per hour to run
each type of three machines are Rs.20 for drilling, Rs.30 for shaping and for
polishing.The capacities for each part on each machine are shown in the following
table.
Machine/Capacity per hour Part A Part B Part C
Drilling 25 40 25
Shaping 25 20 20
Polishing 40 30 40
(MAY/JUNE 2007)
(28)Write down the dual of the following LPP and solve it.
Max Z = 4x1 + 2x2
Sub to
-x1 x2 -3
-x1 + x2 -2 & x1, x2 0.
Solution : Infeasible solution
Solution :
(a) Max Z = 45, x1 = 0, x2 = 9.
(b) Max Z = 53, x1 = 0 , x2= 5, x5 = 4.
m n
Min Z = Cij xij subject to the constraints
i=1 j=1
n
xij = ai i = 1,2, .., m
j=1
m
xij = bj j = 1,2, .., n Where
i=1
ai = Number of units available in iththe origin
bj = Number of units required in jth destination
Cij = transportation cost from iththe origin to jth destination
3. What is an unbalanced transportation problem ? How to solve it?
A transportation problem is said to be unbalanced if the total supply is not equal to
the total demand ie
m n
ai bj
i=1 j=1
the unbalanced transportation problem is converted in to a balanced one by adding a
dummy row or dummy column whichever is necessary. The unit transportation cost
for the dummy row or column elements are assigned zero. Then the problem is solved
by the usual procedure.
4. Define (i) Feasible solution (ii) Basic feasible solution (iii) Non-degenerate solution
Feasible solution : A set of non-negative values xij satisfies the constraint
equation is called a feasible solution.
Basic feasible solution : A basic feasible solution is said to be basic, if the
number of positive allocations are m+n-1 . If the number of allocations are equal
to m+n-1, it is called non-degenerate basic feasible solution.
5. What do you understand by degeneracy in a transportation problem
If the number of occupied cells in a m x n transportation problem, is less than
(m+n-1) , then the problem is said to be degenerate.
6. When does a TP have a unique solution ?
While doing optimality test, if a empty cell evaluations ie ij = Cij (ui + vj) are
positive, then the problem is said to be have an unique solution.
7. What is the purpose of MODI method ?
MODI method is the test procedure for optimality involves examination of each
unoccupied cell to determine whether or not making an allocation in it reduce the
total transportation cost and then repeating this procedure until lowest possible
transportation cost is obtained.
8. List any three approaches used with TP for determining the starting soloution (or) the
initial basic feasible solution.
a. North West corner rule (ii) Least cost entry method (iii) Vogels
approximations method.
9. How will you identify that a TP has got an alternate optimal solution ?
While doing optimality test, if any empty cell evaluation ie
ij = Cij (ui + vj) = 0 then the problem is said to have an alternate optimal
solution.
10. When do you say that the occupied cell is in independent position ?
When it is not possible to draw a closed loop from the allocations, the occupied
cell is in independent position .
11. What is maximization type transportation problem and how these problems are
solved?
The main objective of transportation problem is to minimize the transportation
cost. In maximization type problems, the objective is to maximize the profit or
maximize the total sales. To solve these problems, we have to convert all the cell
entries by multiplying 1. Then the problem is solved by the usual method.
12. Write down the basic steps involved in solving a transportation problem.
a. To find the initial basic feasible solution
b. To find an optimal solution by making successive improvements from the
initial basic feasible solution.
13. State the necessary and sufficient condition for the existence of a feasible
solution to a transportation problem?
The necessary and sufficient condition for the existence of feasible solution is a
solution that satisfies all conditions of supply and demand.
14. What is an assignment problem ? Give two applications ?
It is a special type of transportation problem in which the number of jobs
allocated for different machines or operators. The objective is to maximize the
overall profit or minimize the total cost for a given assignment schedule.
a. It is used in production environment in which the number of jobs are assigned
to number of workers or machines in such a way that the total time to
complete all the jobs will be minimum.
b. It is used in traveling salesman.
15. What do you mean by an unbalanced AP?
Since the assignment is one to one basis the problem have a square matrix. If the
given problem is not a square matrix ie the number of rows and columns are not
same then it is called unbalanced assignment problem. To make it a balanced
assignment add a dummy row or dummy column and then convert it into a
balanced one. Assign zero cost values for the dummy row or column and solve it
by usual assignment method.
16. State the difference between TP & AP
Assignment Transportation
Allocations are made one to one More than one allocation is possible in each
basis.Therefore only one occupied cell row and each column . Hence it neet not be
will be Present in each row and each a square matrix.
column. Hence the table will be a
square matrix.
It will always provide degeneracy It will not provide degeneracy
The supply at any row and demand at The supply and demand may have any
any column will be equal to 1 positive quantity.
n n
Min Z = Cij xij subject to the constraints
i=1 j=1
19. What is the name of the method used in getting the optimum assignment ?
Hungarian method.
20. What is the indication of an alternate solution in an assignment problem ?
If the final cost matrix contains more than the required number of zero for
assignment at independent position then it indicated that the problem has an
alternate optimal solution.
21. What do you inderstand by resticted assignments ? Explain how should one
overcome it ?
In assignment problems, it is assured that the performance of all the machines
and operators are same. Hence any machine can be assigned to any job. But in
practical cases, a machine cannot do all the operations of a job and operator
cannot do all kinds of tasks. Therefore a high processing time is assigned to the
impossible cell (M or ) and then it will be solved by the usual assignment
method. In the final assignment the restricted cell will not be present.
22. Write two theorems that are used for solving assignment problems
Theorem 1 : The optimum assignment sschedule remains unaltered if we add or
subtract a constant to / from all the elements of the row or column of the
assignment cost matrix.
Theorem 2 : If for an assignment problem all Cij 0, then an assignment
schedule (xij) which satisfies Cij xij = 0 , must be optimal.
23. Write the mathematical formulation of an assignment problem.
n n
Min Z = Cij xij subject to the constraints
i=1 j=1
n
xij = 1
i=1
n
xij = 1
j=1
xij = 1, if i th job is assigned to j th operator
0, otherwise
Cij = Cost of assigning the n th job to m th machine.
24. What is traveling salesman problem and what are its objectives ?
In this model a salesman has to visit n cities. He has to start from a particular
city, visit each city once and then return to his starting point. The main objective
of a salesman is to select the best sequence in which he visited all cities in order
to minimize the total distance traveled or minimize the total time.
25. Why assignment problem will always provide degeneracy ?
In assignment problem, the allocation is one to one basis therefore, the number of
occupied cells in each row and each column will be exactly equal to 1. Hence
assignment problem will always provide degeneracy.
26. Why a transportation technique or the simplex method cannot used to solve an
assignment problem
The transportation technique or simplex method cannot be used to solve the
assignment problem because of degeneracy .
PART-B
1. Obtain the initial solution for the following TP using NWCR, LCM, VAM
Source
Destination
A B C Supply
1 2 7 4 5
2 3 3 1 8
3 5 4 7 7
4 1 6 2 14
Demand 7 9 18 34
2. Solve the TP where the cell entries denote the unit transportation costs.
Source
Destination
A B C D Supply
3. P 5 4 2 6 20 Solve the following
Q 8 3 5 7 30 TP.
R 5 9 4 6 50
Source
Demand 10Destination
40 20 30 100
1 2 3 Capacity
1 2 2 3 10
2 4 1 2 15
3 1 3 1 40
Demand 20 15 30
Warehouse
D1 D2 D3 D4 Supply
F1 19 30 50 10 7
F2 70 30 40 60 9
F3 40 8 70 30 18
Demand 5 8 7 14
Warehouse
A B C D E F Available
1 9 12 9 6 9 10 5
2 7 3 7 7 5 5 6
3 6 5 9 11 3 11 2
4 6 8 11 2 2 10 9
Requirement 4 4 6 2 4 2
Source Destination
A B C D Supply
1 11 20 7 8 50
2 21 16 20 12 40
3 8 12 8 9 70
7. Demand 30 25 35 40 Solve the following
TP to maximize the
profit.
Source
Destination
A B C D Supply
1 40 25 22 33 100
2 44 35 30 30 30
3 38 38 28 30 70
Demand 40 20 60 30
TO
1 2 3 Supply
1 5 1 7 10
2 6 4 6 80
3 3 2 5 15
Demand 75 20 50
Destination
S1 S2 S3 S4 D1 D2
S1 0 6 24 7 24 10
S2 10 0 6 12 5 20
S3 15 20 0 8 45 7
S4 18 25 10 0 30 6
D1 15 20 60 15 0 10
D2 10 25 25 23 4 0
11. A firm having 2 sources S1 & S2 wishes to ship its products to 2 destinations
D1 & D2. The number of units available at S1 & S2 are 5 & 25 resp. and the
product demanded at D1 & D2 are 20 & 10 units respectively. The firm
instead of shipping directly decides to investigate the possibility of
transshipment. The unit transportation costs (in rupees) are given in the
following table. Find the optimal shipping schedule.
A B C D
I 1 4 6 3
II 9 7 10 9
III 4 5 11 7
IV 8 7 8 5
A B C D
I 10 25 15 20
II 15 30 5 15
III 35 20 12 24
IV 17 25 24 20
Men
A B C D E
I 1 3 2 8 8
II 2 4 3 1 5
III 5 6 3 4 6
IV 3 1 4 2 2
V 1 5 6 5 4
Jobs
Machine
1 2 3 4 5
A 11 17 8 16 20
B 9 7 12 6 15
C 13 16 15 12 16
D 21 24 17 28 26
E 14 10 12 11 15
Machine
A B C D
1 3 6 2 6
2 7 1 4 4
3 3 8 5 8
4 6 4 3 7
5 5 2 4 3
6 5 7 6 4
Machine
1 2 3 4 5 6
A 11 17 8 16 20 15
B 9 7 12 6 15 13
C 13 16 15 12 16 8
D 21 24 17 28 2 15
E 14 10 12 11 15 6
If the job C cannot be assigned to machine 6, will the optimum solution change?
18. A company has four machines to do three jobs. Each job can be assigned to
one and only one machine. The cost of each job on each machine is given in
the following table.
1 2 3 4
A 18 24 28 32
B 8 13 17 19
C 10 15 19 22
What are job assignments which will minimize the cost.
20. There are four machines in a machine shop. On a particular day the shop got
Orders for executing five jobs (A, B, C, D & E). the expected profit for each
job on each job on machine is as follows:
1 2 3 4
A 32 41 57 18
B 48 54 62 34
C 20 31 81 57
D 71 43 41 47
E 52 29 51 50
Find the optimal assignment of job to machines to maximize the profit. Which
job should be rejected.
21. A marketing manager has five salesmen working under his control to be
assigned to five sales territories. Taking into account the sales potential of the
territories and the capabilities of the salesman, the marketing manager
estimated the sales per month(in thousands of Rs.) for each combination and is
presented as below. Find the assignment of salesmen to sales Territories to
maximize the sales value per month.
22. Solve the following assignment problem using Hungerian method. The matrix
entries are processing times in hours.
Job Operator
1 2 3 4 5
1 20 22 35 22 18
2 4 26 24 24 7
3 23 14 17 19 19
4 17 15 16 18 15
5 16 19 21 19 25
23. Five wagons are available at five stations 1, 2, 3, 4 and 5. These are required
at five stations I, II, III, IV and V. the mileages between various stations are
given by
From To
I II III IV V
1 10 5 9 18 11
2 13 29 6 12 14
3 3 2 4 4 5
4 18 9 12 17 15
5 11 6 14 19 10