Linear Programming

Graphical method
Dr A R M Harunur Rashid

Objectives(Questions for
exams)
Define Linear Programming.
Describe the procedure of formulation of a
linear programming problem.
Show graphical solution of a linear
programming problem.

Learning Outcomes(how
students will be able to use it in
real life)

Students will be able to use Linear

Programming in real life like deciding the
product mix(if there are two products, what
quantity should be produce of each one
for maximizing profit or minimizing loss).

Linear Programming
A method for solving a problem which has
several constraints that have less than or
greater than thing,i.e. inequalities, rather
than just equal.

Linear Programming
Linear programming is a technique for the
optimization of a linear objective function,
subject to linear equality and linear
inequality constraints.

Ex 3, pg 156, Busi math by

Arora
A firm uses three machines in the manufacture of
three products. Each unit of product A requires 3
hours on machine I, 2 hours on machineII, 1 hour on
machineIII. Each unit of product B requires 4 hours
on machine I, 1 hours on machineII, 3 hour on
machineIII Each unit of product C requires 2 hours on
each of the three machines.The contribution margin
of the three products is Tk 30, Tk 40, and Tk 35 per
unit respectively. The machine hours available on the
three machines are 90,54 and 93 respectively for a
specific time periond(i.e.a month). Formulate the
above as a linear programming problem and solve for
maximum profit using simplex method.

 There are kind of infinite no of possible

solution. So there should be to find an
optimal with finite no of steps.

 In every formulation, each variable could

be only nonnegative in real life. So
nonnegative constrains must be present
by default.

Graphical solution
Use a graph or make your own .
Since nothing could be negative, use positive-positive quadrant of
the graph after selecting centrepoint (0,0)
To find the two points for a two variable problems, first set the
equation to equal sign omitting inequality(e.g.greater than or less
than sign)
Set one variable to zero value and find the corresponding other
variable by putting the value in the equal equation. x/a+y/b=1
method may be used instead.
Then set another variable to zero and find the other variable value
by putting the value in the equation.
Now you get two points each in one axis. Just add these two
points and you will get the line.

 The feasible portion is just only one side of the

straight-line comprising a constraint. You need to find
which side the feasible region falls.
To find out the feasible region, choose
centrepoint(0,0) as your reference point. When you
put the values,that is zero and zero for x1 and x2
respectively, if it satisfies the inequality, then the side
of the straight line where the centrepoint(0,0) lies is
the feasible region or portion whatever you call.
Otherwise feasible portion is on the other side of the
straight line.

 If z=10 then using first putting x1=0,

x2=2.5. Again putting x2=0, x1=2. so two
points (0,2.5) and (2,0) are found.
Connecting these two points we get z line.

 If a straight line goes through zero origin,

then to draw the line take some positive
value and find the other coordinate of the
point. Then add origin and the point.
Second constraint assume x1=200 and
putting in the equation gets x2=140. So
connecting (0,0) and this found
point(200,140), we get second constraint
line.

 For third constraint assume x1=100 and

putting in the equation gets x2=30. So
connecting (0,0) and this found
point(100,30), we get third constraint line.

 Since two lines go through origin we need

to take other origin as reference point to
find out feasible side. For example ,if we
take (100,0) and it does not satisfy, then
the feasible part in the other side of the
line. Here first and second constraint do
not satisfy (100,0). So their feasible part is
not towards (100,0) but opposite way.

 To draw z line, assume z=900. Then putting

x1=0 in the equation gets x2=1000. So
(0,1000) is a point in z line.
Next put x2=0 in the equation we get
x1=3000. So (3000,0) is another point in the z
line.
Connect the above two point to get the z line.
Since minimizing problem, z line will go down
gradually within the feasible zone.

 To find the intersecting point , you may

use the graph or solve using the two
equations of lines that intersect at that
point
Here x1=470 and x2=329