Linear Programming is a technique which is used to find a solution for optimizing a given objective.

Objectives may be maximizing profit or minimizing cost. Objective function and boundary conditions are linear in nature.

Linear Programming is a mathematical technique for finding the best uses of an organizations resources. It helps an organization in planning and decision making.

Objective Function Constraints Finite number of variables Optimal Solution

 Conversion of stated problem into a mathematical model that abstracts all the essential elements of the problem.

Exploration of different solutions of the problem.

Finding out the most suitable or optimum solution.

Let:

X1, X2, X3, , Xn = decision variables

Z = Objective function or linear function

Requirement: Maximization of the linear function Z.

Z = c1X1 + c2X2 + c3X3 + + cnXn
subject to the following constraints:

..Eq (1)

Max z = 3x1 + 2x2 Subject to (s.t.)

(objective function)

2 x1 + x2 100 (finishing constraint) x1 + x2 80 (carpentry constraint) x1 40 (constraint on demand for soldiers) x1 0 (sign restriction) x2 0 (sign restriction)

A dealer wishes to purchase a number of fans and sewing machines. He only has Rs.5760 to invest & has space for almost 20 items. A fan costs him Rs.360 & a sewing machine Rs.240. His expectation is that he can sell a fan at profit of Rs.22 & a sewing machine at a profit of Rs.18.Assuming that he can sell all the items that he can buy, how should he invest his money in order to maximize his profit. Formulate it as a LPP & use graphical method to solve it.

A company produces 2 types of pens,say A & B. Pen A is a superior quality & B is a lower quality pen. Profit on Pen A & B is Rs.5 & Rs.3 per pen resp. Raw material required for each pen A is twice as that for B. The supply of raw material is sufficient only for 1000 pens of type B per day. pen A requires a special clip & only 400 such clips are available per day. For B, only 700 clips are available per day. Find the product mix so that the company can make maximum profit.

Min z = 6x1 + 14x2 Subject to (s.t.) 5 x1 + 4x2 60 x1 + 2x2 18 3 x1 + 7x2 84 and x1 0 x2 0

(objective function)

A diet for a sick person must contain atleast 4000 unit of vitamins,50 units of minerals & 1400 calories. Two foods are available at a cost of Rs.4 & Rs.3 per unit resp. If one unit of A contains 200 units of vitamins,1 unit of minerals & 40 calories & one unit of food B contains 100 unit of vitamins,2 units of minerals & 40 calories. Find by graphical method what combination of foods be used to have least cost?

Max z = 2x1 + 3x2 Subject to (s.t.)

(objective function)

x1 + x2 30
x2 3 x2 12

x1 -x2 0
x1 20 x1 0

x2 0

Solve graphically :

Max z = -5x2
Subject to (s.t.) x1 + x 2 1

(objective function)

-0.5x1 -5 x2 -10 x1 0 x2 0

Product Mix. The Diet Problem Media selection Blending Problem Transportation Problem Travelling salesmans Problem, etc..

The notion of duality within linear programming asserts that every linear program has associated with it a related linear program called its dual. The original problem in relation to its dual is termed the primal.

Standard form of Primal Problem

max Z c j x j
x j 1

a11 x1 a12 x2 ... a1n xn b1 a21 x1 a22 x2 ... a2 n xn b2 ............ ............ am1 x1 am 2 x2 ... amn xn bm x1 , x2 ,...,xn 0

Standard form of Dual Problem

min w bi yi
y i 1

a11 y1 a21 y2 am1 ym c1 a12 y1 a22 y2 am 2 ym c2 a1n y1 a2 n y2 amn ym cn y1 , y2 , , ym 0

maxZ 80x1 60x2 50x3

x

8 x1 6 x2 4 x3 100 5 x1 4 x2 4 x3 60 x1 , x2 , x3 0

minw 100 y1 60 y2
y

8 y1 5 y2 80 6 y1 4 y2 60 4 y1 4 y2 50 y1 , y2 0

Q-6) A firm buys castings of P and Q of parts and sells them as finished product after machining, boring and polishing. The purchasing cost for castings are Rs. 3 and Rs. 4 each for parts P and Q and selling costs are Rs. 8 and Rs. 10 respectively. The per hour capacity of machines used for machining, boring and polishing for the two products is given below: Parts P Q Machining 30 50 Boring 30 45 Polishing 45 30

The running costs for machining, boring and polishing are Rs. 30, Rs. 22.5 and Rs. 22.5 per hour respectively. Find out the product mix to maximize the profit using LP Method.

Q-7)Give the Linear Programming solution of the following product mix problem: The Product A, B and C are produced in three machine centres X, Y and Z. Each product involves operation of each of the machine centres. The time required for each operation for unit amount of each product is given below. Time available at machine centres X, Y and Z are 100, 77 and 80 hours respectively. The profit per unit of A, B and C is Rs. 12, Rs. 3 and Rs. 1 respectively. Products Machine Centres Profit Per Unit X
A B C 10 2 1

Y
7 3 2

Z
2 4 1 12 3 1