KONERU LAKSHMAIAH EDUCATION FOUNDATION

Department of Mathematics

Course Name : Mathematical Programming Course Code : 21CS2204RB

CO-1(Sesson-wise Problems)

Session-1 : (Introduction of Linear Programming, Formation of LPP, Graphical Method)

1. A company has three operational departments(Weaving, Processing and Packing) with capacity to
produce three different types of clothes namely suitings, shirtings and woolens yielding a profit of Rs.2,
Rs.4 and Rs.3 per metre respectively. One metre of suiting requires 3 mins. In weaving, 2 mins. In
processing and 1 min. in packing. Similarly one metre of shirting requires 4 mins. In weaving, 1 min. in
processing and 3 mins. In packing. One metre of woolen requires 3 mins. In each department. In a
week, total run time of each department is 60, 40 and 80 hours for weaving, processing and packing
respectively. Formulate the LPP to find the product mix to maximize the profit.

2. Use a Graphical Method to solve the following LPP :

Maximize : zx1  x2 subject to the constraints

x1  x2  2000, x1  x2  1500, x2  600, x1 , x2 0 .

3. Use the Graphical Method to solve the following LPP :

Minimize : z 3 x1  2 x2 subject to the constraints

5 x1  x2 10, x1  x2  6, x1  4 x2 12; x1 , x2 0

Session-2 : (Solution of LPP by Simplex Method)

1. Solve the following LPP by applying Simplex Method :

Maximize : z 12 x1  16 x2 subject to the constraints

8 x1  8x2  80, 10 x1  20 x2  120; x1 , x2  0

2. Solve the following LPP by applying Simplex Method :

Minimize : z  x1  3 x2  2 x3 subject to the constraints

3 x1  x2  2 x3  7,  2 x1  4 x2  12,  4 x1  3 x2  8 x3  10; x1 , x2 , x3  0

1
Session-3 : (Duality Concept in LPP and Solution by Simplex Method)

1. Form the dual of the following primal problem :

Maximize : z  4 x1 10 x2  25 x3 subject to the constraints

2 x1  4 x2  8 x3  25, 4 x1  9 x2  8 x3  30,6 x1  8x2  2 x3  40; x1 , x2 , x3  0

2. Form the dual of the following primal problem :

Minimize : z  20 x1  40 x2 subject to the constraints

2 x1  20 x2  40, 20 x1  3x2  20, 4 x1 15x2  30; x1 , x2  0 .

3. Form the dual of the following primal problem :

Minimize : z  2 x1  6 x2 subject to the constraints

9 x1  3x2  20, 2 x1  7 x2  40; x1 , x2  0 .

4. Solve the following LPP using the result of its dual problem:

Minimize : z  24 x1  30 x2 subject to the constraints

2 x1  3x2  10, 4 x1  9 x2  15, 6 x1  6 x2  20; x1 , x2  0 .

Session-4 : (Dual Simplex Method )

1. Apply Dual Simplex Method to solve the following LPP:

Maximize : z   3 x1  x2 subject to the constraints

x1  x2  1, 2 x1  3x2  2; x1 , x2  0 .

2. Apply Dual Simplex Method to solve the following LPP:

Maximize : z   2 x1  2 x2  4 x3 subject to the constraints

2 x1  3x2  5 x3  2, 3x1  x2  7 x3  3, x1  4 x2  6 x3  5; x1 , x2 , x3  0 .

3. Apply Dual Simplex Method to solve the following LPP:

Minimize : z  2 x1  x2  x3 subject to the constraints

4 x1  6 x2  3 x3  8, x1  9 x2  x3  3,  2 x1  3x2  5x3  4; x1 , x2 , x3  0 .

2
 Session-5 : (Feasibility of solution using Farka’s Lemma)

1. Farka’slemma is stated as: Let A be a matrix of size m×n and b be a vector of size m. Then,
exactly one of the following holds:

i) There exists a vector x such that Ax=b and x ≥0.

ii) There exists y satisfying ATy ≥ 0 and bTy<0

Then, for the following linear programing, find out the equivalent forms Ax=b, x ≥0 and ATy ≥
0, bTy<0.

Max x1+2x2+3x3
s.t.
x1-x2-x3= 5
2x1+3x2+x3=1
2x1+x2+3x3=0

2. Verify the feasibility of the followinglinearprogram using Farka’s lemma:

Max x1+x2+x3
s.t. x1+ x2+ x3=6,
2x1+3x2+x3=8,
2x1+x2+3x3=0

Session-6: (Ellipsoid method)

1. Convert the all points (x,y) in and on the two dimensional ellipse x2 /a2+y2/b2≤ 1 into matrix notation
xTAx≤ 1.

2. Draw the three dimensional ellipse x2 /a2+y2/b2+z2/c2≤ 1 and construct the diagonal matrix A of the
matrix notation xTAx≤ 1.

Session-7: (Integer Programming : Branch & bound algorithms)

1. Apply branch and bound method to solve the following LPP :

Maximize : z  7 x1  9 x2 subject to the constraints

 x1  3x2  6, 7 x1  x2  35, x2  7; x1 , x2  0 and are integers.

2. Apply branch and bound method to solve the following LPP :

3
 Minimize : z  4 x1  3 x2 subject to the constraints

5x1  3x2  30, x1  4, x2  6 ; x1 , x2  0 and are integers.

3. Apply branch and bound method to solve the following LPP :

Minimize : z  2 x1  3 x2 subject to the constraints

5x1  7 x2  35, 4 x1  9 x2  36 ; x1 , x2  0 and are integers.

Session-8: (Karmarkar’s Algorithm)

1. Explain Karmarkar’s Algorithm briefly.

2. Apply Karmarkar’s Algorithm to solve the following LPP :

Minimize : z  x1  3 x2  3 x3 subject to the constraints

x1  3x2  2 x3  0, x1  x2  x3 1; x1 , x2 , x3  0