KONERU LAKSHMAIAH EDUCATION FOUNDATION

Department of Mathematics

Course Name : Mathematical Programming Course Code : 21CS2204RB

CO-1(Tutorial)

Tutorial Session-1 : (Formation of LPP, Graphical Method, Simplex Method)

1. The owner of a shop producing automobile trailers wishes to determine the best mix for
his three products: flat-bed trailers, economy trailers, and luxury trailers. His shop is
limited to working 24 days/month on metalworking and 60 days/month on woodworking
for these products. The following table indicates production data for the trailers:
Usage per unit of trailer Resources Resources
Flat - bed Economy Luxury availabilities
Metalworking days 1/2 2 1 24
Woodworking days 1 2 4 60
Contribution ($ × 100) 6 14 13
Formulate the mathematical modelling of the linear programming problem

2. Using the Graphical Method, obtain the optimum solution of the LPP of

Maximizing : z 10 x1  15 x2 subject to the constraints

2 x1  x2  26, x1  2 x2  28,  x1  x2  5; x1 , x2 0

3. A firm manufactures 2 types of products A & B and sells them at a profit of $2 on type A & $3
on type B. Each product is processed on 2 machines G & H. Type a requires 1 minute of
processing time on G and 2 minutes on H. Type B requires 1 minute on G & 1 minute on H. The
machine G is available for not more than 6 hrs. 40 mins., while machine H is available for 10
hrs. during any working day. Formulate the problem as LPP.
4. Using the graphical method to solve following linear programming problem:
Maximise Z = 4x + y subject to the constraints: x + y ≤ 50, 3x + y ≤ 90, x ≥ 0, y ≥ 0.
5. Determine graphically the minimum value of the objective function Z = – 50x + 20y, subject
to the constraints: 2x – y ≥ – 5, 3x + y ≥ 3, 2x – 3y ≤ 12, x ≥ 0, y ≥ 0.