LINEAR PROGRAMMING

OPERATIONS RESEARCH
FORMULATION OF LINEAR
PROGRAMMING PROBLEM
I. Identify decision variables.

II. Set the objective function.

III. List out the constraints.
ASSUMPTIONS MADE IN THE
FORMULATION OF L.P.P.
I. Linearity

II. Additivity

III. Continuity

IV. Non-negativity

V. Finite choices
TECHNIQUES OF SOLVING LINEAR
PROGRAMMING PROBLEM
I. Graphical Method

II. Simplex Method
GRAPHICAL SOLUTION
FEASIBLE SOLUTION SPACE
A region bounded by all the constraints.

DIRECTIONS OF ARROWS
For LESS THAN OR EQUAL TO TYPE
Constraint arrows should point towards origin.

For GREATER THAN OR EQUAL TO TYPE
Constraint arrows should point away from origin.



GRAPHICAL SOLUTION
MAXIMIZATION

Iso-profit line will pass
through the farthest
corner of solution
space from origin.

Farthest corner will
give the maximum
profit.

MINIMIZATION

Iso-cost line will pass
through the nearest
corner of solution
space from origin.

Nearest corner will
give the min.cost

PROBLEM -1
A contractor has been assigned the excavation
work of a canal and of the headwork on a
project. In order to ensure a balanced progress
on the entire work the management has
imposed certain conditions on the working. The
excavation of canal is more profitable than that
of the headwork, but has to abide by the
conditions of contract. In addition he has his own
limitations on manpower and equipment. It is
desired to find the optimum amount of
excavation on the two works which he should
undertake so that his profits are maximized
And he satisfies the constraint of contract and
of the resources. These constraints are given
below;
i) The difference in the quantity of earthwork
done on the two works does not exceed 2
units in a day.
ii) The difference in the quantity of canal
excavation and of twice the headwork
excavation does not exceed 1 units in a day.
iii) Each unit of canal excavation done in a day
requires one unit of manpower and one unit of
machines; and each unit of headwork
excavation requires 2 units of manpower and
and one unit of machines. Maximum available
manpower is 10 units and machines 6 units.
The contractor stipulates a profit of 2 thousand
rupees for each unit of canal excavation and half
of this for each unit of headwork excavation.
Formulate as a Linear Programming Problem.
Solve using graphical method. Determine the
optimal quantities of canal and headwork
excavation to maximize the overall profit.
PROBLEM -2
A firm plans to purchase at least 200 quintals of
scrap containing high quality metal X and low
quality metal Y. It decides that the scrap to be
purchased must contain at least 100 quintals of
metal X and not more than 35 quintals of Y
metal. The firm can purchase the scrap from two
suppliers A and B in unlimited quantities. The
percentage of X and Y metals in terms of weight
in the scrap supplied by A and B is given below
:


METALS SUPPLIER A SUPPLIER B
X 25% 75%
Y 10% 20%

The price offered by supplier A is Rs.200 per
quintal and that of B is Rs.400 per quintal. The
firm wants to determine the quantities that it
should purchase from the two supplier so that
procurement cost is minimized.

PROBLEM -3
Dwight is an elementary school teacher who
also raises pigs for supplementary income. He is
trying to decide what to feed his pigs. He is
considering using a combination of pig feeds
available from local suppliers. He would like to
feed the pigs at minimum cost while also making
sure each pig receives an adequate supply of
calories and vitamins. The cost, calorie content
and vitamin content of each feed are given in the
table below.
Content Feed type A Feed type B
Calories per 800 1000
Pound
Vitamins per 140 70
Pound
Cost per pound 0.40 0.80

Each pig requires at least 8000 calories per day and
at least 700 units of vitamins. A further constraint is
that no more than one third of the total diet (by
weight) can consists of feed type A ,since it contains
an ingredient which is toxic if consumed in too large
a quantity. Formulate as a L.P.P. and solve using
graphical method.
PROBLEM -4
The Apex Television Company has to decide on
the number of 27 and 20 inch sets to be
produced at one of its factories. Market research
indicates that at most 40 of the 27-inch set and
10 of the 20 inch sets can be sold per month.
The maximum number of work hours available is
500 per month. A 27 inch set requires 20 work
hours and a 20 inch set requires 10 work hours.
Each 27 inch set sold produces a profit of 120$
and each 20 inch set produces a profit of 80$.
Formulate as L. P. Problem.