LINEAR PROGRAMMING PROBLEMS

(LP MODEL FORMULATION)

Introduction:
Linear programming is a mathematical technique for choosing the best alternative
from a set of feasible alternatives, in such a situations, where the objective function
as well as the restrictions or constraints can be expressed as linear mathematical
function
The term linear means that all the variables occurring in the objective function and
the constraints are of the first degree in the problem (under consideration).
The term programming refers that, the process of determining a particular course
of action
Basic Assumption of L.P.P:
s.n Characteris
Meaning
o
tics
1
Proportionalit The contribution of each variable in the objective function or its
usage of the resources in directly proportional to the value of the
y
2

Additivity

Divisibility

Deterministic

Finiteness

variable [ ie., if resource availability increases by some percentage,

then the output shall also increase by the same percentage]
Sum of the resources used by different activities must be equal to
the total quality of resource used by each activity for all the
resources individually
The variable are not restricted to integer values

coefficients in the objective function and constraints are completely

known and do not change during the period under study in all the
problems considered
Variables and constraints are finite in numbers

Note:
The L.P problem involves only one objective function. If more than one objective for
the decision making problem, then use Goal programming.
COMPONENTS OF L.P.P:
1. Decision variables:
Decision variables are the variables, whose values determine the solution of a
problem.
2. Objective function:
Objective function is a function of decision variables, which explicit the prime
objective of the decision making problem
3. Constraints:
Constraints are the set of simultaneous linear equations and/ or in-equations
GENERAL FORM OF L.P.P:

Optimize Z=c1 x1 + c2 x2 + +c n x n
Subject the constraints
a11 x 1+ a12 x 2 + . .+a1 n x n ( ) b1

a21 x 1 +a 22 x2 +.........................+a2 n x n ()b 2

.

.
am 1 x 1+ am 2 x 2 +.........................+ amn xn () b m
x i 0 i=1,2, ........... n
SOLUTIONS OF L.P.P:
1. Solution

A set of values x1, x2,............ xn, which satisfies the

constraints of the L.P.P is called its solution

2. Basic solution

For a given system of m simultaneous linear equations

in n unknowns (m < n)
AX = B
Then a solution obtained by setting n- m variables not
associated with the columns of B, equal to zero, and solving
the resulting system, is called a basic solution to the given
system of equation.
A feasible solution to an L.P.P, which is also a basic solution
to the problem, is called a basic feasible solution to the
L.P.P
Any feasible solution, which optimizes the objective
function of the L.P.P, is called its optimum / optimal
solution.
A basic solution to the system is called degenerate if one or
more of the basic variable vanish

3. Basic
feasible
solution
4. Optimal solution
5. Degenerate
solution

FORMULATION OF L.P.P
Problem1:
A company has three operational departments namely, weaving, processing
and packing with capacity to produce three different types of cloths namely
suitings , shirtings and woollen yielding a profit of Rs. 2, Rs. 4 and Rs.3 per metre
respectively. One metre suiting requires 3 minutes in weaving, 2 minutes in
processing and 1 minute in packing. Similarly one metre of shirting requires 4
minutes in weaving, 1 minute in processing and 3 minutes in packing while one
metre of woollen requires 3 minutes in each department. In a week, total run time
of each department is 60, 40 and 80 hours of weaving, processing and packing
departments respectively. Formulate as a linear programming model.
Solution:
Given that,
Resources
Products
Resources
Availability
Suiting
Shirting
Woollen
Weaving Dept.
3 min
4min
3 min
60 hrs
Processing Dept.
2min
1 min
3min
40 hrs
Packing Dept.
1min
3 min
3 min
80 hrs
Profit (Rs.)
2
4
3
Then the mathematical formulation of given LPP is

Let

x1 , x2 , x3

be the decision variables represent the products suitings,

Shirtings, Woollens respectively.

maximize Z=2 x 1+ 4 x 2+ 3 x 3
subject

3 x1 + 4 x 2+3 x 3 ( 60 60 mins ) [Weaving Dept ]

2 x 1 + x 2+ 3 x 3 ( 40 60 mins ) [Processing Dept ]
x 1+3 x 2 +3 x3 ( 80 60 mins ) [ Packing Dept ]
x1 , x2 , x3 0
ie; maximize Z =2 x 1 +4 x 2 +3 x 3
subject

3 x1 + 4 x 2+3 x 3 3600[Weaving Dept ]

2 x 1 + x 2+ 3 x 3 2400 [Processing Dept ]
x 1+3 x 2 +3 x3 4800[ Packing Dept ]
x1 , x2 , x3 0

Problem 2:
A company makes two types of leather products A and B. Product A is of high
quality and product B is of lower quality. The respective profits are Rs. 4 and Rs. 3
per product. Each product A requires twice as much time as product B and if all
products were of type B, the company could make 1000 per day. The supply of
leather is sufficient for only 800 products per day ( both A and B combined). Product
A requires a special spare part and only 400 per day are available. There are only
700 special spare parts a day available for product B. Formulate this as Linear
programming problem.
Solution:
Given that,
products
Availability/
Resource
Requirement
Type-A Type-B
Profit(in Rs)
4
3
production
capacity
2
1
1000
(if all were of
Type-B)
Leather
1
1
800
spare part for A
1
400
spare part for B
1
700
Problem 3:

The owner of Metro sports wishes to determine how many advertisements to

place in selected three monthly magazines A, B and C. His objective is to advertise
in such a way that total exposure to principal buyers of expensive sports goods is
maximized. Percentage of readers for each magazine is known. Exposure in any
particular magazine is the number of advertisements placed multiplied by the
number of principal buyers. The following data may be used:
Magazine
A
B
Readers
1 lakh
0.6 lakh
Principal buyers
10%
15%
Cost per advertisement(Rs.)
5,000
4,500
The budget amount is at most Rs. 1 lakh for the advertisements. The owner has
decided that magazine A should have no more than 6 advertisements and that B
and C each have at least two advertisements. Formulate an L.P model for the
problem.
Solution:
Given that,
Magazines
Availabili
ty/
A
B
C
Resource
Require
ment
Readers
1,00,00 60,00 40,00
0
0
0
Principal Buyers
10%
15%
7%
Cost per
5,000
4,500 4,250 1,00,000
Advertisement (in Rs)
Advertisement for A
1
6
(maximu
m)
Advertisement for B
1
2 (at
least)
Advertisement for C
1
2 (at
least)
Objective: To Maximize the principal buyers from the advertisement.

Let x 1 , x 2 , x 3 be thedecision variables repersents the magazines A , BC respectively

Then the mathematical model of given decision making problem is

Maximize Z =( 1,00,000 10 ) x1 + ( 60,000 15 ) x 2 + ( 40,000 7 ) x 3

subject

5,000 x 1 + 4,500 x 2 +4,250 x 3 1,00,000( for Budject )

x 1 6(for Magazine A )
x 2 2(for Magazine B)
x 3 2(for Magazine C)

C
0.4 lakh
7%
4,250

x 1, x 2 , x 3 0
ie. , Maximize Z=10,000 x 1 +9,000 x 2+ 2,800 x 3
subject
5,000 x 1 + 4,500 x 2 +4,250 x 3 1,00,000( for Budject )
x 1 6(for Magazine A )
x 2 2(for Magazine B)
x 3 2(for Magazine C)
x 1, x 2 , x 3 0
Problem 4:
A farmer has a 100 acre farm. He can sell all the Tomatoes, Lettuce and
Radishes. Whenever he rises is fully sold in the market. The price he can obtain is
Re. 1 per Kilogram for Tomatoes, Re. 0.75 a head for Lettuce and Rs. 2 per kilogram
for radishes. The average yield per acre is 2000 kilogram of Tomatoes, 3000 head of
Lettuce and 1,000 kilogram of Radishes. Fertilizer is available at Re. 0.50 per
Kilogram and the amount required per acre is 100 kilogram each for Tomatoes and
Lettuce, and 50 kilogram for Radishes. Labour required for sowing, cultivating and
harvesting per acre is 5 man-days for Tomatoes and Radishes, and 6 man-days for
Lettuce. A total of 400 man-days of labour are available at Rs. 20 per man-day.
Formulate this problem as a linear programming model to maximize the
farmers total profit.
Solution:
Given that,
Problem 5:
Mr.Krishnamoorthy, a retired Govt. Officer, has received his retirement
benefits, viz provident fund, gratuity, etc., He is contemplating as to how funds he
should invest in various alternatives open to him so as to maximize return on
investment. The investments alternatives are Govt. Securities, fixed deposits of a
public company, equity shares, time deposits in banks, national saving certificates
and real estate. He has made a subjective estimate of the risk involved on a five
point scale. The data on the return on investment, the number of years for which
the fund will be blocked to earn this return on investment and the subjective risk
involved are as follows:
Returns
No. Of Years
Govt. securities
6%
15
Company deposits
15%
3
Equity shares
20%
6
Time deposits
10%
3
National saving certificates
12%
6
Real estate
25%
10
He was wondering what percentage of funds he should invest in each alternative sp
as to maximize the return on investment. He decided that the average risk should
not be more than 4, and funds should not be locked-up for more than 15 years. He

Risk
1
3
7
1
1
2

would necessary invest at least 30% in real estate. Formulate an L.P model for this
problem
Problem 6:
An animal feed company must produce 200 lbs of a mixture containing the
ingredient X and Y. X costs Rs. 3 per lbs, and Y costs Rs. 8 per lbs. Not more than 80
lbs of X can be used and minimum quantity to be used for Y is 60 lbs. Find how
much of each ingredient should be used if the company wants to minimize the cost.
Formulate the problem as a L.P model.
Problem 7:
A firm manufactures headache pills in two sizes A and B. Size A contains 2
grains of aspirin, 5 grains of bi-carbonate and 1 grain of codeine. Size B contains 1
grain of aspirin, 8 grains of bi-carbonate and 6 grains of codeine. It is found by users
that it requires at least 12 grains of aspirin, 74 grains of bi-carbonate and 24 grains
of codeine for providing immediate effect. It is require determining the least number
of pills a patient should take to get immediate relief. Formulate the problem as a
L.P.P.
GRAPHICAL SOLUTION METHOD
(OR)
(SEARCH APPROACH METHOD)

Problem 1: