1

Dayalbagh Educational Institute (Deemed University),

Faculty of Engineering, Department of Mathematics,
Question Bank(2018-2019)
MAM 681, Advanced Optimization Techniques
(Year of Revision: 2019)

UNIT I

1. Reddy Mikks produces both interior and exterior paints from two raw materials M 1 and M 2 .

m
The following table provides the basic data of the problem:

er as
Tons of raw material per ton of

co
Exterior paints Interior paints Maximum daily availability

eH w
Raw material, M 1 6 4 24

o.
1 2 6
Raw material, M 2
rs e
ou urc
Profit per ton ($ 1000) 5 4
A market survey restricts the maximum daily demand of interior paint to 2 tons.
Additionally, the daily demand for interior paint can not exceed that of exterior paint by more
o

than 1 tons. Reddy Mikks wants to determine the optimum (best) product mix of interior and
aC s

exterior paints that maximizes the total daily profit.

vi y re

2. A manufacturer produces two types of models M 1 and M 2 . Each M 1 model requires 4 hours
of grinding and 2 hours of polishing; whereas each model of type M 2 requires 2 hours of
grinding and 5 hours of polishing. The manufacturer has two grinders and 3 polishers. Each
ed d

grinder works for 40 hours a week and each polisher works for 60 hours a week. Profit on
ar stu

M 1 model is Rs 3 and on M 2 model is Rs 4. What ever produced in a week is solid in the

market. How should the manufacturer allocate his production capacity to the two types of
sh is

models so that he may make the maximum profit in a week?

3. The Handy- Dandy company wishes to schedule the production of a kitchen appliance that
Th

requires two resources- labour and material. The company is considering three different
models and its production engineering department has furnished the following data.
Model
A B C
Labour (hours per unit) 7 3 6
Material (pounds per unit) 4 4 5
Profit ($ per unit) 4 2 3
The supply of raw material is restricted to 200 pounds per day. The daily availability of
labour is 150 hours. Formulate the linear programming model to determine the daily
production rate of the various models in order to maximize the total profit.

https://www.coursehero.com/file/49058042/QB-MAM6812018pdf/
 2

4. Define convex set. Show that the set of all feasible solutions of a L.P. problem constitutes a
convex set.
5. Define extreme point of a feasible region. Show that the optimal solution of a L.P. problem
occurs at the extreme point of a feasible region.
6. Define strictly concave and strictly convex function. Show that the quadratic form
f ( x1 , x2 , x3 ) = 5 x12 + 5 x22 + 4 x32 + 4 x1 x2 + 2 x2 x3 is strictly convex.
7. Define positive definite / negative definite quadratic form. Show that the quadratic form
Q ( x1 , x2 , x3 ) = 2 x12 + 2 x22 + 3x32 + 2 x1 x2 + 2 x2 x3 is positive definite.
8. Solve the L.P. problem graphically
Maximize z = 3x1 + 2 x2
Subject to − x1 + 2 x2  4

m
er as
3 x1 + 2 x2  14

co
x1 − x2  3

eH w
x1 , x2  0

o.
rs e
9. Use simplex method to solve the following L.P. problem
ou urc
Maximize z = 7 x1 + 5 x2
Subject to x1 + 2 x2  6
4x1 + 3x2  12
o

x1 , x2  0
aC s
vi y re

10. Solve LP Problem

Maximize z = 2 x1 + 3 x2 + 4 x3
Subject to 2x1 + x2 + 3 x3  50
ed d

x1 + 3 x2 + x3  25
ar stu

x1 + 2 x2 + x3  26
x1 , x2 , x3  0
sh is

11. Solve LP problem by simplex Method

Maximize z = 3x1 + 2 x2
Th

Subject to -x1 + 2 x2  4
3x1 + 2 x2  14
x1 − x2  3
x1 , x2  0
Search if possible alternate optimal solution.

https://www.coursehero.com/file/49058042/QB-MAM6812018pdf/
 3

12. Use simplex method to solve

Maximize z = x1 + 2 x2 + 3x3 + 4 x4
Subject to x1 + 2 x2 + 2 x3 + 3 x4  20
2x1 + x2 + 3 x3 + 2 x4  20
x1 , x2 , x3 , x4  0
Is the optimal solution unique why or why not?
13. Solve the L.P. problem by big M method
Minimize z = −3x1 + x2 + x3
Subject to x1 − 2 x2 + x3  11
-4x1 + x2 + 2 x3  3
2x1 − x3 = −1

m
er as
x1 , x2 , x3  0

co
eH w
14. Solve the problem by Big M method
Maximize z = 2 x1 + x2

o.
rs e
Subject to x1 + 3x2  3
ou urc
3x1 + x2  3
x1 + x2  3
x1 , x2  0
o
aC s

15. Solve the L.P. problem by two phase method

vi y re

Minimize z = 4 x1 + x2
Subject to 3x1 + x2 = 3
4x1 + 3 x2  6
ed d

x1 + 2 x2  4
ar stu

x1 , x2  0
16. Solve the LP problem by two phase method
Maximize z = x1 − 3x2
sh is

Subject to x1 + x2  2
Th

x1 x2
+ 1
5 −1
x1 x2
+ =1
−1 1
x1 , x2  0

https://www.coursehero.com/file/49058042/QB-MAM6812018pdf/
 4

17. Solve the LP problem by two phase method

Maximize z = 4 x1 + x2
Subject to 4x1 + x2  4
5x1 + 3x2  15
x1 , x2  0
18. Solve by two phase method
Maximize z = 3x1 + x2
Subject to x1 + 2 x2  2
2x1 + x2  2
x1 + x2  2

m
x1 , x2  0

er as
19. Find all the basic feasible solutions of a L.P. problem

co
eH w
Maximize z = 2 x1 − 4 x2 + 5 x3 − 6 x4
Subject to x1 + 4 x2 − 2 x3 + 8 x4 = 2

o.
rs e
x1 + 2 x2 + x3 + 2 x4 = 4
ou urc
x1 , x2 , x3 , x4  0
Find, also all non degenerate basic feasible solutions..
o
aC s
vi y re
ed d
ar stu
sh is
Th

https://www.coursehero.com/file/49058042/QB-MAM6812018pdf/
 5

UNIT II

1. Use revised simplex method to solve the following L.P.P

Maximize z = 6 x1 − 2 x2 + 3x3
Subject to 2 x1 − x2 + 2 x3  2
x1 + 4 x3  4
x1 , x2 , x3  0
2. Solve by revised simplex method
Maximize z = x1 + 2 x2
Subject to 3x1 + x2  1
x1 + 3x2  1

m
er as
x1 , x2  0

co
eH w
3. Solve by revised simplex method
Maximize z = 2 x1 + x2

o.
rs e
Subject to 3x1 + x2  3
ou urc
x1 + 3x2  3
x1 , x2  0
o

4. Write the dual of the following primal linear programming problem

Minimize z = 4 x1 + 5 x2 − 3x3
aC s
vi y re

Subject to x1 + x2 + x3 = 22
3x1 + 5 x2 − 2 x3  65
x1 + 7 x2 + 4 x3  120
ed d

x1  0, x2  0, x3 unrestricted
ar stu

Then find the dual of dual. Is dual of dual is primal?

5. Using dual simplex method solve the following LPP
Minimize z = 3x1 + 2 x2
sh is

Subject to 3x1 + x2  3
Th

4x1 + 3x2  6
x1 + x2  3
x1 , x2  0
6. Solve LPP by using dual simplex method
Minimize z = 3x1 + 2 x2
Subject to x1 + x2  20
2x1 + x2  2
x1 , x2  0

https://www.coursehero.com/file/49058042/QB-MAM6812018pdf/
 6

7. Solve LPP by simplex method after converting it in dual LPP

Minimize z = x1 + x2
Subject to 3x1 + x2  1
x1 + 3x2  2
x1 , x2  0
8. At any simplex iteration of the primal or the dual, prove that, the objective coefficient of
variable j in one problem is equal to the left hand side minus right hand side of the constraint
j in the other problem.
9. For any pair of feasible primal and dual solutions, prove that, objective value in the
maximization problem is less than or equal to objective value in the minimization problem.
10. Prove that the dual of the dual is primal.

m
er as
11. Prove that the necessary and sufficient condition for any LPP and its dual to have an optimal

co
solution is that both must have feasible solution.

eH w
12. What is post optimality analysis (sensibility analysis)

o.
Solve the LP problem
rs e
Maximize z = − x1 + 2 x2 − x3
ou urc
Subject to 3x1 + x2 − x3  10
-x1 + 4 x2 + x3  6
o

x2 + x3  4
aC s

x1 , x2 , x3  0
vi y re

Determine the effect of discrete changes in those components of the cost vector which
correspond to basic variables.
13. Solve the following LP problem by the decomposition algorithm.
ed d

Maximize z = 3x1 + 5 x2 + x4 + x5
ar stu

Subject to x1 + x2 + x4 + x8 = 40
5x1 + x2 + x3 = 12
x4 + x5 − x6 = 5
sh is

x4 + 5 x5 + x7 = 50
Th

x1 , x2 , x3 , x4 , x5 , x6 , x7 , x8  0

14. Prove that in the transportation problem with m sources and n destinations, the number of
independent constraints is m+n-1.

https://www.coursehero.com/file/49058042/QB-MAM6812018pdf/
 7

15. Find the basic feasible solution of a transportation problem, using North West corner method.
The cost matrix is given below

D1 D2 D3 D4 Supply 
O1 10 2 20 11 15
O2 12 7 9 20 25
O3 4 14 16 18 10
O4 5 7 2 4 15
Demand → 5 15 20 25

16. Using Least cost method , find the basic feasible solution of the transportation problem
whose cost matrix is given below

m
er as
1 2 3 4 Supply

co
1 30 10 0 40 20

eH w
2 0 0 10 50 20

o.
3 20 10 40 5 100
Demand 20 rs e 20 60 20
ou urc
17. Applying Vogel approximation method (VAM), find the basic feasible solution of the
o

transportation problem whose cost matrix is given below

aC s
vi y re

M1 M2 M3 M4 Supply
W1 2 2 2 1 3
ed d

W2 10 8 5 4 7
ar stu

W3 7 6 6 8 5
Demand 4 3 4 4
sh is

18. Find the optimal solution of the balanced transportation problem

Th

D1 D2 D3 Supply 
O1 0 4 2 8
O2 2 3 4 5
O3 1 2 0 6
Demand → 7 6 6

https://www.coursehero.com/file/49058042/QB-MAM6812018pdf/
 8

19. Determine the optimal solution of unbalanced transportation problem whose cost matrix is
given below

D1 D2 D3 Supply 
O1 5 1 7 10
O2 6 4 6 18
O3 3 2 5 15
Demand → 75 20 50

20. Three reservoirs with daily supplies of 15, 20 and 25 million liters of fresh water
respectively. On each day we must supply four cities A, B, C, D whose demands are 8, 10, 12
and 15 respectively. The cost of pumping per million liters is given below

m
Cities

er as
A B C D

co
eH w
1 2 3 4 5
Reservoirs 2 3 2 5 2

o.
3
rs e
4 1 2 3
ou urc
Use the transportation algorithm to determine the cheapest pumping schedule if excess water
can be disposed of at no cost.
o
aC s
vi y re
ed d
ar stu
sh is
Th

https://www.coursehero.com/file/49058042/QB-MAM6812018pdf/

Powered by TCPDF (www.tcpdf.org)