LINEAR PROGRAMMING

Definition:
• A collection of procedures for maximizing
or minimizing linear functions subject to
given linear constraints.

• Planning by the use of linear relationship

of variables involved.
Properties:
• The objective must be either to maximize or to
minimize.
• The actions of the decision maker must be
constrained and the decision variables must not
violate the limitations/constraints.
• All variables have a value greater than or equal
to zero.
• The relationship of variables can be expressed
in terms of equations or inequalities.
Setting up a system constraints:
Problem.
Beta Company makes small and large washing
machines. Each small washing machine
requires 3 kilograms of plastic and 3 kilograms
of steel and each large one requires 10
kilograms of plastic and 4 kilograms of steel. If
the company has 2400 kilograms of plastic and
1200 kilograms of steel available, formulate the
system constraints.
Solution:
Let x = no. of small washing machines to be produced.
y = no. of large washing machines to be produced.

Requirements Small (x) Large (y) Availability

Plastic 3 kgs 10 kgs 2400 kgs
Steel 3 kgs 4 kgs 1200 kgs

System Constraints:
3X + 10Y ≤ 2400 (plastic)
3X + 4Y ≤ 1200 (steel)
X≥0 (nonnegative constraints)
Y≥0
Explanation:
• If Beta Co. makes 80 small and 120 large washing
machines

3(80) + 10(120) ≤ 2400

240 + 1200 ≤ 2400
1440 ≤ 2400 (true)

3(80) + 4(120) ≤ 1200

240 + 480 ≤ 1200
720 ≤ 1200 (true)
Explanation:
• If Beta Co. makes 100 small and 300 large washing
machines

3(100) + 10(300) ≤ 2400

300 + 3000 ≤ 2400
3300 ≤ 2400 (false)

3(100) + 4(300) ≤ 1200

300 + 1200 ≤ 1200
1500 ≤ 1200 (false)
LP: Graphical Method
Problem.
Suppose that Beta Co. makes a profit of P600 on each
small washing machine and P1000 on each large one,
how many units of each model should be produced to
maximize the profit.

Requirements Small (x) Large (y) Availability

Plastic 3 kgs 10 kgs 2400 kgs

Steel 3 kgs 4 kgs 1200 kgs

Profit P600 P1000
Solution:
Maximize : P = 600X + 1000Y

Subject to : 3X + 10Y ≤ 2400

3X + 4Y ≤ 1200
X≥0
Y≥0

To Graph 3X + 10Y ≤ 2400

X-intercept Y-intercept
Let Y=0 Let X=0
3X + 10(0) = 2400 3(0) + 10Y = 2400
3X = 2400 10Y = 2400
Y = 240
X = 800
(0, 240)
(800, 0)
Solution:
Graph
Solution:
Graph
Solution:
To Graph 3X + 4Y ≤ 1200

X-intercept Y-intercept
Let Y=0 Let X=0
3X + 4(0) = 1200 3(0) + 4Y = 1200
3X = 1200 4Y = 1200
Y = 300
X = 400
(0, 300)
(400, 0)
Solution:
Graph
Solution:
Graph

Area of feasible solution

V1 V2

V3
Solution:
To find V2

By elimination:

a) 3X + 10Y = 2400 To eliminate X subtract equation (b) from (a)

b) 3X + 4Y = 1200
6Y = 1200
6 6
Y = 200

Substitute y-val to eq (a)

3X + 10(200) = 2400
3X + 2000 = 2400
3X = 400
3 3

X = 133.33

Therefore V2 : (133.33, 200)

Solution:
Graph

V1 V2

V3
Solution:
Graph

V1
V2

V3
Solution:
To find the optimum solution

Vertices: Obj: 600X + 1000Y Profit

(0, 240) 600(0) + 1000(240) P240,000
(133, 200) 600(133) + 1000(200) P279,800
(400, 0) 600(400) + 1000(0) P240,000

Conclusion:

To maximize profit, Beta Co. should produce 133 units of small and 200 large
washing machines with the expected profit of P279,800