Scribd
Upload
11 views5 pages

Lec 1,2

The document explains linear programming, which involves optimization problems defined by inequality constraints and an objective function. It outlines the conditions necessary for formulating a linear programming problem and provides examples of how to maximize profit using graphical methods. The conclusion highlights the maximum profit achievable at specific points within the feasible region defined by the constraints.

Uploaded by

omondiv394
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views5 pages

Lec 1,2

The document explains linear programming, which involves optimization problems defined by inequality constraints and an objective function. It outlines the conditions necessary for formulating a linear programming problem and provides examples of how to maximize profit using graphical methods. The conclusion highlights the maximum profit achievable at specific points within the feasible region defined by the constraints.

Uploaded by

omondiv394
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

LINEAR PROGRAMMING

A linear programming problem involves constraints that contain inequalities. An


inequality is denoted with familiar symbols, <, >, ≤, and ≥.

In order to have a linear programming problem, we must have:

 Inequality constraints
 An objective function, that is, a function whose value we either want to be as large as
possible (want to maximize it) or as small as possible (want to minimize it).

Generally speaking linear programming can be used for optimization problems if the following
conditions are satisfied;
1. There must be a well defined objective function which can be expressed as a linear
function of decision variables.
2. There must be constraints on the amount or extent of attainment of the objective and
these constraints must be capable of being expressed as linear equations or inequalities in
terms of variables.
3. There must be alternative courses of action eg a given product may be processed by two
different machines and the problem may be as to how much of the product to allocate to
which machine.
4. The decision variables should ne interrelated and non negative. Nin negativity means
linear programming deals with real life situations for which negative quantities are
generally illogical.

FORMULATION OF LINEAR PROGRAMMING PROBLEMS


In order to formulate the LP problem, first define the variables of the problem
establishing the interrelationship between them and formulating the objective function
and constraints. A model which approximates as closely as possible to the given problem
is then to be developed.

1
EXAMPLE ONE
A firm produces three products. These products are processed on three different
machines. The time required to manufacture one unit of each of the three products and
the daily capacity of the three machines is given in the table below;
Time per unit ( minutes)
Machine Product 1 Product 2 Product 3 Machine capacity
( minutes per day)
M1 2 3 2 440
M2 4 - 3 470
M3 2 5 - 430

The profit per unit for products I, 2 and 3 is sh 4, sh 3 and sh 6 respectively.

Required
Formulate a linear programming model that will maximize daily profit.

SOLUTION
Let x1, x2 and x3 respectively be amounts of products 1, 2 and 3 produced daily
Objective function will be
Maximize Z= 4x1+ 3x2+6x3
Subject to constraints
2x1+ 3x2+2x3<440………………..( i)
4x1+ 0x2+3x3<470………………..(ii)
2x1+ 5x2+0x3<430……………….(iii)

GRAPHICAL METHOD

In this case, we use a graph to solve a linear programming problem.

Example one Maximize Z=20,000 x +15,000 y

Such that

x +2 y ≤ 2
2 x+ y ≤ 2.5
x ≤ 0.5
Solve the problem using graphical method

Solution

First get coordinates for constraint equations

2
x +2 y ≤ 2
Coordinates

X 0 2

Y 1 0

2
If x=0, 0+2 y ≤2 y= =1
2
If y =0,

x +2 ( 0 ) ≤ 2 , x=2
Coordinates become (0,1) and (2,0)

2 x+ y ≤ 2.5
Coordinates

X 0 1

Y 2.5 0.5

If x = 0, 2(0)+ y ≤ 2.5

Y=2.5

If x=1,

2(1)+ y ≤ 2.5
Y=2.5 – 2 = 0.5

Coordinates are (0,2.5) and (1,0.5)

x ≤ 0.5
This is a straight line perpendicular to x axis at point 0.5

3
Graph
y axis

2.5
2 x + y ≤ 2.5
2.0

1.5

1.0
B x +2 y ≤ 2
C
0.5 F.R

x ≤0.5
A D
0.5 1.0 1.5 2.0 2.5
x axis
FR = Feasible region
Its is an area defined by a set of coordinates that satisfy a system of inequalities.
The region satisfies all the restrictions imposed by linear programming scenario.
We need the coordinates of the corner points

POINT COORDINATES Z=20,000 x+15,000 y

A (0,0) Z=20,000 ( 0 ) +15,000 ( 0 ) =0

B (0,1) Z=20,000 ( 0 ) +15,000 ( 1 )=15,000

C ( 0.5,0.75) Z=20,000 ( 0.5 ) +15,000 ( 0.75 ) =21,250

D ( 0.5,0) ¿ 20,000 ( 0.5 ) +15,000 ( 0 )=10,000

4
CONCLUSION
Profit will be maximized at point C and maximum profit will be 21,250

Example 2
Max Z= 1,000x + 1,500y
Subject to
2x+ 4y < 100
3x + 2y < 80
Solve using graphical method

You might also like