LP Model Formulation

Decision variables
mathematical symbols representing levels of activity of an
operation

Objective function
a linear relationship reflecting the objective of an operation
most frequent objective of business firms is to maximize profit
most frequent objective of individual operational units (such as a
production or packaging department) is to minimize cost

Constraint
a linear relationship representing a restriction on decision
making

Steps of Mathematical Formulation of Linear Programming

Problem:
1. Detect the decision variables (which are to be determined) in the
problem and assign symbol to them ( x1, x2, x3).
2. Identify all the constraints in the problem and express them in
the form of linear equations or in equalities, as the case may be.
3. Express the non negativity condition of decision variables such
as x10, x2 0 etc.
4. Identify the objective function of the problem and express it as
linear function of decision variable Objective function is
generally denoted by Z. Also note whether the objective
function is to be maximized or to be minimized.

LP Model Format
Max/min

z = c 1x1 + c2x2 + ... + cnxn

subject to:
a11x1 + a12x2 + ... + a1nxn (, =, ) b1
a21x1 + a22x2 + ... + a2nxn (, =, ) b2
:
am1x1 + am2x2 + ... + amnxn (, =, ) bm
xj = decision variables
bi = constraint levels
cj = objective function coefficients
aij = constraint coefficients
And
The decision variables 0

LP Model: Example
RESOURCE REQUIREMENTS
PRODUCT
Bowl
Mug

Labor
(hr/unit)
1
2

Clay
(lb/unit)
4
3

Revenue
(Rs./unit)
40
50

There are 40 hours of labor and 120 pounds of clay

available each day
Decision variables
x1 = number of bowls to produce
x2 = number of mugs to produce

LP Formulation: Example
Maximize Z = 40 x1 + 50 x2
Subject to
x1 + 2x2 40 hr

(labor constraint)

4x1 + 3x2 120 lb (clay constraint)

x1 , x2 0

Graphical Solution Method

1. Plot model constraint on a set of coordinates
in a plane
2. Identify the feasible solution space on the
graph where all constraints are satisfied
simultaneously
3. Find the values corresponding to it and
hence find the solution by using the objective
function.

Graphical Solution: Example

x2
50
40
4 x1 + 3 x2 120 lb

30
20

Area common to
both constraints

10
0

x1 + 2 x2 40 hr

|
10

|
20

|
30

|
40

|
50

|
60

x1

Computing Optimal Values

x2
40

4 x1 + 3 x2 120 lb

30

x1 +

2x2 =

40

4x1 +

3x2 =

120

4x1 +

8x2 =

160

-4x1 -

3x2 =

-120

5x2 =

40

x2 =

2(8) =

40

24

20
10

x1 + 2 x2 40 hr

0
8

x1 +
x1

|
10

24 |
|
20
30

x1
|
40
Z = Rs.50(24) + Rs.50(8) = Rs.1,360

Extreme Corner Points

x1 = 0 bowls
x2

x2 =20 mugs

40

Z = Rs.1,000

x2 =8 mugs
Z = Rs.1,360

30
20

x1 = 24 bowls

B
|
10

x2 =0 mugs
Z = 1,200

10
0

x1 = 30 bowls

|
20

C|
|
30 40

x1

Solution is x1 = 24 bowls x2 = 8 mugs

Revenue = Rs.1,360
Since the objective function was to
maximize.

Special Situation in LP
Infeasibility
When no feasible solution exists (there
is no feasible region)

Infeasible Model
No point, simultaneously,

lies both above line 1 and

2 and 3
below lines
.

1
12

Unbounded Solutions when nothing

prevents the solution from becoming
infinitely large
Max 2X1 + 2X2
Subject to:

2X1 + 3X2 > 6

X1, X2 > 0

n
o
i
t on
c
re luti
i
D so
of

X2

0
0

X1

Max 2X1 + 2X2

Subject to:
2X1 + 3X2 > 6
T, C > 0

Unbounded solution
th
eO

Ma
xim
bje
ize
cti
Th
ve
ef
Fu
nc
re ea
ti
s
g

io ibl
n
e

on

14

Special Situation in LP
Alternate Optimal Solutions when there is
more than one optimal solution
X2
10

1
2X

Max 2X1 + 2X2

All points on
Red segment
are optimal

2
2X
=
20

X1 + X2 < 10
X1
< 5
X2< 6
X1, X2 > 0

Subject to:
6

0
0

10

X1

Ex: A firm manufactures three products A,B,C the profits are Rs

3, Rs 2, & Rs 4 respectively. The firm has two machines M1& M2
and below given is the required processing time in minutes for
each machine on each product.

Machine

Product

M1

A
4

B
3

C
5

M2

Machines M1 & M2 have 2000 & 2500 machine minutes

respectively. The firm must manufacture 100 As, 200 Bs & 50
Cs, but not more than 150 As. Set up an LPP to maximize
profits.

Ex : The objective of a diet problem is to ascertain that quantities

of certain food should be eaten to meet certain nutritional
requirements at a minimum cost. The consideration is limited to
milk, beef & eggs and to vitamins A B & C. the number of
miligrams of each vitamins contain with a unit of each food is
given below.
Minimum
Vitamin Milk
Beef
Eggs
daily
requirements
(mg)

A
B
C

1
100
10

1
10
100

cost

Rs 1

Rs1.10 Rs .50

Formulate this LPP.

10
10
10

1
50
10

Ex : Solve the LPP by graphical method:

Minimize

Z = 3X1 + 2X2

Subject to

5X1 + X2 10
X1 + X2 6
X1 + 4X2 12
X1, X2 0

A toy company manufactures two types of

dolls. Basic Version A and Deluxe version B.
Each doll of Type B takes twice as long as to
produce as of type A and the company have
time to make a maximum of 2000 per day if it
produces only the basic version. The supply
of plastic is sufficient to produce 1500 dolls
per day (both A & B) The deluxe version
requires a fancy dress of which 600 per day is
available. The profit is Rs.3 And Rs. 5
respectively for doll A and B. How many dolls
must be manufactured to maximize the profit.

Ex : Find the maximum value of Z = 5X1 +7 X2

Subject to

X1 + X2 4
3X1 + 8X2 24
10X1 + 7X2 35
X1, X2 >0

Ex : Max Z = 8X1 + 5X2

Subject to

2X1 + X2 500
X1 150
X2 250
X1, X2 0

Ex : Solve the following graphically.

Minimize Z = 20X1 + 10 X2
Subject to,
X1 + 2 X2 40
3 X1 + X2 30
4 X1 + 3X2 60
X1, X2 0.