LINEAR PROGRAMMING PROBLEM

UNIT – 8
 OPERATIONS RESEARCH
Operations research is a subfield of applied mathematics that uses advanced mathematical
principles or analytical methods to solve the problems that business leaders and managers
often experience. It’s an art of winning a war without actually fighting it.

DEFINITIONS
• OR is the application of scientific methods, techniques and tools to problems involving the
operations of systems so as to provide these in control of the operations with optimum
solutions to the problem.
• OR is a scientific method of providing executive departments with a quantitative basis for
decision regarding operations under their control.
• OR is the art of giving bad answers to problems to which otherwise worst answers are
given.
 ANALYSING AND
CONSTRUCTING A
OBSERVATION DEFINING THE
MODEL
PROBLEM

TESTING AND
IMPLEMENTATION SELECTING DATA
OBTAING
OF SOLUTION INPUTS
SOLUTION
 LINEAR PROGRAMMING PROBLEM
LPP is a problem of optimization (maximization or minimization) of a linear function Z ( profits,
sales, cost, etc.) subject to a linear constraints.
The function Z which is to be optimized is called the Objective Function.
Z = c1x1+c2x2+c3x3+………+cnxn
subject to the constraints
a11x1+a12x2+………..+ a1nxn ( ≤ = ≥ ) b1
a21x1+a22x2+………..+ a2nxn ( ≤ = ≥ ) b2

am1x1+am2x2+………..+ amnxn ( ≤ = ≥ ) bm
and the non- negative restrictions
x1 ≥ 0,x2 ≥ 0, xn ≥ 0
• Decision Variables. The variables x1, x2,…..,xn whose values are to be determined are
called decision variables.
• Cost Coefficients. The coefficients c1,c2,…..,cn are called Cost (profit) Coefficients.
• Requirements. The constants b1,b2,…..,bn are called Requirements.
• Solution. A set of real values X= (x1, x2,…..,xn)which satisfies the constraints AX ( ≤ = ≥ ) b
is called Solution.
• Feasible Solution. A set of real values X= (x1, x2,…..,xn) which
i. Satisfies the constraint AX ( ≤ = ≥ ) b
ii. Satisfies the non-negative restriction X ≥ 0 is called Feasible Solution.
• Optimal Solution. A set of real values X= (x1, x2,…..,xn) which
i. Satisfies the constraint AX ( ≤ = ≥ ) b
ii. Satisfies the non-negative restriction X ≥ 0
iii. Optimizes the objective function Z = CX is called Optimal Solution
RESULTS

• If an LPP has many (two or more) optimal solutions it is said to have Multiple Solutions.
• If an LPP has only one optimal solution , it is said to have Unique Solution.
• If the LPP has no feasible solution at all, it is said to have No Solution.
• If the optimal value of Z is infinity the LPP is said to have Unbounded Solution.
 Application of LPP
• Assignment Problem
• Transportation Problem
• Production Management
• Marketing Management
• Manpower Management
• Physical Distribution
 ADVANTAGES OF LPP
• Linear Programming Problem helps us in making the optimum utilization of
productive resources.
• The quality of decisions may also be improved by linear programming
problem. User becomes more objective rather than being subjective.
• LPP provides practically applicable solutions since there might be other
constraints operating outside the problem which must also be taken into
consideration.
• The best advantage of LPP in production process is that it highlights
bottlenecks.
 FORMULATING LPP
A firm manufactures two types of products A and B and sells them at a profit of Rs.2 on type A
and Rs.3 on type B. Each product is processed on two machines G and H. Type A requires one
minute of processing time on G and two minutes on H; type B requires one minute on G and one
minute on H. The machine G is available for not more than 6 hour 40 minutes while machine H
is available for 10 hours during any working day. Formulate the problem as a linear
programming problem.
A person wants to decide the constituents of a diet which will fulfill his daily requirements of
proteins, fats and carbohydrates at minimum cost. The combination is made among two food
products whose contents are indicated below.
Food Content Cost/ Unit (Rs.)
Proteins Fats Carbohydrates
A 3 2 6 45
B 4 2 4 40
Min. 800 200 700
Requirement
Formulate the LPP.
A toy company manufactures two types of doll, a basic version – doll A and a delux version-
doll B. Each doll of type B takes twice as long to produce as one of type A, and the company
would have time to make a maximum of 2000 per day. The supply of plastic is sufficient to
produce 1500 dolls per day (both A and B combined). The deluxe version requires a fancy
dress of which there are only 600 per day available. If the company makes a profit of Rs. 3 and
Rs. 5 per doll, respectively on doll A and b , then how many of each doll should be produced
per day in order to maximize the total profit. Formulate this problem.
A firm manufactures 3 products A, B and C. The profits are Rs.3, Rs.2 and Rs. 4 respectively.
The firm has 2 machines and below is the required processing time in minutes for each
machine on each product.
Product
A B C
Machine G 4 3 5
H 2 2 4

Machine G and H have 2,000 and 2,500 machine – minutes, respectively. The firm must
manufacture 100A’s , 200B’s and 50 C’s but no more than 150A’s. Set up a LPP to maximize
profit.
 GRAPHICAL METHOD
Solve the following LPP graphically.
Maximize Z = 50 X1+ 18X2
subject to
2 X1 + X2 ≤ 100
X1 + X2 ≤ 80
X1 ≥ 0 , X2 ≥ 0
Solve the following LPP graphically.
Maximize Z = 3X1+5X2
subject to
X1 + 2X2 ≤ 2000
X1 + X2 ≤ 1500
X2 ≤ 600
X1 ≥ 0 , X2 ≥ 0
Solve the following LPP graphically.
Maximize Z = 8000 X1+ 7000 X2
subject to
3 X1 + X2 ≤ 66
X1 + X2 ≤ 45
X1 ≤ 20
X2 ≤ 40
X1 , X2 ≥ 0
Solve the following LPP graphically.
Maximize Z = 0.5 X2 – 0.10 X1
subject to
2X1 + 5X2 ≤ 80
X1 + X2 ≤ 20
X1 ≥ 0 , X2 ≥ 0
A firm uses lathes, milling machines and grinding machines to produce two types of
equipments A and B. Equipment A requires 12 hours on lathe, 4 hours on milling machine and
2 hours on grinding machine. Equipment B requires 6 hours on lathe, 10 hours on milling
machine and 3 hours on grinding machine. The total available time on each machine are 6000
hours on lathe, 4000 hours on milling machine and 1800 hours on grinding machine.
Equipment A fetches a profit of Rs. 400 per unit and equipment B fetches a profit of Rs.1000 per
unit. Formulate the LPP and solve it graphically.
Solve the following LPP graphically.
Min. Z = 1.5 X1+ 2.5X2
subject to
X1 + 3X2 ≥ 3
X1 + X2 ≥ 2
X2 ≤ 600
X1 ≥ 0 , X2 ≥ 0
 SPECIAL CASES
Solve the following LPP graphically.
Max. Z = 3X1+ 2X2
subject to
X1 - X2 ≤ 1
X1 + X2 ≥ 3
X1 ≥ 0 , X2 ≥ 0
Solve the following LPP graphically.
Maximize Z = 3X1 – 2X2
subject to
X1 + X2 ≤ 1
2X1 + 2X2 ≥ 4
X1 ≥ 0 , X2 ≥ 0
Solve the following LPP graphically.
Max. Z = X1+ X2
subject to
X1 - X2 ≥ 0
-3 X1 + X2 ≥ 3
X1 ≥ 0 , X2 ≥ 0