LINEAR PROGRAMMING

Boni Sena,S.T.,M.Eng.

WHAT IS LINEAR PROGRAMMING ?

How much fuel that we need ?

How many tire which can be carried on ?

LINEAR PROGRAMMING (STUDY CASE)

Suppose a consumer has income $60 per week. He wants to buy food A costs $2 per kilogram and food B costs $3 per kilogram. Arrange linear programming for this problem !

First step : Make table which describe the problem. You have to determine parameter or decision variable. Cost become parameter in this problem. See the table below :
Parameter A B Maximum Capacity

Cost

$2

$3

$60

LINEAR PROGRAMMING (STUDY CASE)

Second Step : State the table in the form of mathematical expressions. Assume the consumer wants to use all of his budget. 2 x + 3 y = 60 (where x 0 and y 0) Third step : Make graph from the math expressions. (Cartesian coordinates)

LINEAR PROGRAMMING (STUDY CASE)

LINEAR INEQUALITY

Definition

A linear inequality in the variables x and y is an inequality that can be written in one of the form

ax + by + c < 0 , ax + by + c > 0, ax + by + c 0 , ax + by + c 0
a, b and c are constant and a and b 0

See the graph below :

Above the line, all points (x,y) satisfy y > mx+b y > mx + b

the line itself, all points (x,y) satisfy y = mx+b

y = mx + b

y < mx + b Below the line, all points (x,y) satisfy y < mx+b

See the graph below :

x=a

x<a

x>a

SYSTEM OF INEQUALITIES

The solution of system of inequalities consists of all points whose coordinates Solve the system

2x+3y>3
xy

y > -2x + 3
yx

2y1>0

y > 1/2

Draw the equation on the graph

THE ANSWER IS..

yx

Solution satisfy
2x+3y>3 xy 2y1>0

y > 1/2

y > -2x +3

Solution

P (x) = ax + by 2x+3y>3

Objective function Constraints Feasible points

2y1>0

Linear Programming

Maximize / minimize

Not only find the feasible region but also Find the way to maximize/minimize the Objective function

STUDY CASE

A company produces two types of can openers : Manual and electric. Each require in its manufacture the use of three machines : A, B and C. Table 7.1 gives data relating to the manufacturer of these can openers.
Manual A B 2 hr 1 hr Electric 1 hr 2 hr Hours Available 180 160

C
Profit/Unit

1 hr
$4

1 hr
$6

100

Find the feasible region

2x + y = 180 160 x + y = 100 120

80
D C

40 Feasible Region

x + 2y = 160
B
A

40

80

120

160

Objective function (P) : 4 x + 6y

y = - 2/3 x + P/6 Try with P = 600 y = - 2/3 x + 100
Has no point in feasible region

160

120

y = - 2/3 x + 50 Try with P = 300

Has infinitely many such points

80

40 Feasible Region
B A

40

80

120

160

Objective function (P) : 4 x + 6y

x = 40 and y = 60 160 x + 2y = 160 x + y = 100 120 y = - 2/3 x + P/6 Try with P = 600 y = - 2/3 x + 100
Has no point in feasible region

y = - 2/3 x + 50 Try with P = 300

Has infinitely many such points

80
D

Isoprofit lines
Maximum profit line
C The line whose y intercept is farthest from the origin and that has at least one point in common with feasible region

40 Feasible Region

B A

40

80

120

160

Objective function (P) : 4 x + 6y

P =4 x + 6y = 4(90)+6(0) = 360 160 P =4 x + 6y = 4(80)+6(20) = 440 P =4 x + 6y = 4(40)+6(60) = 520 120 P =4 x + 6y = 4(0)+6(80) = 480 (0,80)

80
D

Thus, P has maximum value at (40,60) (40,60)

C

40 Feasible Region (80,20)

B A

(90,0) 120

40

80

160