LINEAR PROGRAMMING

The Problem in Words

Decide the Daily Production Quantity of Interior and Exterior paints

So as to Maximize Profit

However, subjected to restrictions (constraints)

Daily consumption of Raw Material M1 should not exceed 24 tons

The Problem in Words
Decide the Daily Production Quantity of Interior and Exterior paints

So as Maximize Profit

However, subjected to restrictions (constraints)

Daily consumption of Raw Material M1 should not exceed 24 tons

Daily consumption of Raw Material M2 should not exceed 6 tons
The Problem in Words
Decide the Daily Production Quantity of Interior and Exterior paints

So as Maximize Profit

However, subjected to restrictions (constraints)

Daily consumption of Raw Material M1 should not exceed 24 tons

Daily consumption of Raw Material M2 should not exceed 6 tons
Demand for interior paints cannot exceed that of exterior by one ton
The Problem in Words
Decide the Daily Production Quantity of Interior and Exterior paints

So as Maximize Profit

However, subjected to restrictions (constraints)

Daily consumption of Raw Material M1 should not exceed 24 tons

Daily consumption of Raw Material M2 should not exceed 6 tons
Demand for interior paints cannot exceed that of exterior by one ton
(Can we replace demand with production quantity to have similar meaning?)
The Problem in Words
Decide the Daily Production Quantity of Interior and Exterior paints

So as Maximize Profit

However, subjected to restrictions (constraints)

Daily consumption of Raw Material M1 should not exceed 24 tons

Daily consumption of Raw Material M2 should not exceed 6 tons
Production for interior paints cannot exceed that of exterior by one ton
Daily demand of interior paints cannot exceed 2 tons
(Can we replace demand with production quantity to have similar meaning?)
The Problem in Words
Decide the Daily Production Quantity of Interior and Exterior paints

So as Maximize Profit

However, subjected to restrictions (constraints)

Daily consumption of Raw Material M1 should not exceed 24 tons

Daily consumption of Raw Material M2 should not exceed 6 tons
Production for interior paints cannot exceed that of exterior by one ton
Production demand of interior paints cannot exceed 2 tons
Decision Variables?
Decision Variables?
Tons of exterior paints to be produced daily

Tons of interior paints to be produced daily

Decision Variables?
𝑥1 Tons of exterior paints to be produced daily

𝑥2 Tons of interior paints to be produced daily

Parameters?
Unit profit – amount of profit to be earned for every unit

Unit consumptions – the amount of raw material consumption for every unit of production

Raw material availability – Limits on the availability of raw materials

Objective Function?

Maximize Profit
Objective Function?
How do you measure?

Maximize Profit
Objective Function?
How do you measure?

Maximize Total Daily Profit

= Unit profit for exterior paints × Quantity of exterior paints produced
+
Unit profit for interior paints × Quantity of interior paints
produced
 Objective Function?
How do you measure?

Maximize Total Daily Profit

= Unit profit for exterior paints × Quantity of exterior paints produced +

Unit profit for interior paints × Quantity of interior paints produced

= 5 𝑥1 + 4 𝑥2
Restrictions/Constraints?
Usage of raw material, M1 ≤ Amount of M1 available

Usage of raw material, M2 ≤ Amount of M2 available

Production for Interior paint can not exceed that of exterior paint by more than 1 ton

Maximum Production for interior paint is 2 ton

Restrictions/Constraints?
Usage of raw material, M1 ≤ Amount of M1 available

6𝑥1 + 4𝑥2 ≤ 24

Usage of raw material, M2 ≤ Amount of M2 available

𝑥1 + 2𝑥2 ≤ 6

Demand for Interior paint can not exceed that of exterior paint by more than 1 ton

−𝑥1 + 𝑥2 ≤ 1

Maximum demand for interior paint is 2 ton

𝑥2 ≤ 2
Restrictions/Constraints?
Usage of raw material, M1 ≤ Amount of M1 available

6𝑥1 + 4𝑥2 ≤ 24
Can the production quantity be negative?
Usage of raw material, M2 ≤ Amount of M2 available

𝑥1 + 2𝑥2 ≤ 6

Demand for Interior paint can not exceed that of exterior paint by more than 1 ton

−𝑥1 + 𝑥2 ≤ 1

Maximum demand for interior paint is 2 ton

𝑥2 ≤ 2
Restrictions/Constraints?
Usage of raw material, M1 ≤ Amount of M1 available

6𝑥1 + 4𝑥2 ≤ 24
Non-negativity Constraint
Usage of raw material, M2 ≤ Amount of M2 available
𝑥1 , 𝑥2 ≥ 0
𝑥1 + 2𝑥2 ≤ 6

Demand for Interior paint can not exceed that of exterior paint by more than 1 ton

−𝑥1 + 𝑥2 ≤ 1

Maximum demand for interior paint is 2 ton

𝑥2 ≤ 2
Graph

𝑥2

𝑥1
Graph
Draw 6𝑥1 + 4𝑥2 = 24
𝑥1 0 4
𝑥2 6 0

𝑥2

𝑥1
Graph
Draw 6𝑥1 + 4𝑥2 = 24
𝑥1 0 4
𝑥2 6 0

𝑥2

𝑥1
Graph
Draw 6𝑥1 + 4𝑥2 = 24
𝑥1 0 4
𝑥2 6 0

𝑥2

𝑥1
Graph
Draw 𝑥1 + 2𝑥2 = 6
𝑥1 0 6
𝑥2 3 0

𝑥2

𝑥1
Graph
Draw 𝑥1 + 2𝑥2 = 6
𝑥1 0 6
𝑥2 3 0

𝑥2

𝑥1
Graph
Draw −𝑥1 + 𝑥2 = 1
𝑥1 0 -1
𝑥2 1 0

𝑥2

𝑥1
Graph
Draw −𝑥1 + 𝑥2 = 1
𝑥1 0 -1
𝑥2 1 0

𝑥2

𝑥1
Graph
Draw 𝑥2 = 2
𝑥1 0 1
𝑥2 2 2

𝑥2

𝑥2 = 2

𝑥1
Graph
Draw 𝑥2 = 2
𝑥1 0 1
𝑥2 2 2

𝑥2

𝑥2 ≤ 2

𝑥1
Graph
Draw 𝑥1 = 0
𝑥1 0 0
𝑥2 1 2

𝑥2

𝑥1 ≥ 0

𝑥1
Graph
Draw 𝑥2 = 0
𝑥1 0 1
𝑥2 0 0

𝑥2

𝑥1 𝑥2 = 0
Graph
Draw 𝑥2 = 0
𝑥1 0 1
𝑥2 0 0

𝑥2

𝑥1 𝑥2 = 0
Graph
Graph

Feasible Solution Space

Graph
Draw 5𝑥1 + 4𝑥2 = 10
𝑥1 0 2
𝑥2 2.5 0
Graph
Draw 5𝑥1 + 4𝑥2 = 10
𝑥1 0 2
𝑥2 2.5 0
Graph
Draw 5𝑥1 + 4𝑥2 = 20
𝑥1 0 4
𝑥2 5 0
Graph
Draw 5𝑥1 + 4𝑥2 = 20
𝑥1 0 4
𝑥2 5 0
Graph
Draw 5𝑥1 + 4𝑥2 = 25
𝑥1 0 5
𝑥2 6.25 0
Graph
Draw 5𝑥1 + 4𝑥2 = 25
𝑥1 0 5
𝑥2 6.25 0
Graph
Draw 5𝑥1 + 4𝑥2 = 21
𝑥1 0 4.2
𝑥2 5.25 0
Graph
Draw 5𝑥1 + 4𝑥2 = 21
𝑥1 0 4.2
𝑥2 5.25 0
Graph
Draw 5𝑥1 + 4𝑥2 = 21
𝑥1 0 4.2
𝑥2 5.25 0

Optimal Point: 𝑥1 = 3; 𝑥2 =1.5; z=$21,000

Graph
Draw 5𝑥1 + 4𝑥2 = 21
𝑥1 0 4.2
𝑥2 5.25 0
6𝑥1 + 4𝑥2 = 24

𝑥1 + 2𝑥2 = 6

Optimal Point: 𝑥1 = 3; 𝑥2 =1.5; z=$21,000

 6 × 6 − 2𝑥2 + 4𝑥2 = 24
𝑥1 + 2𝑥2 = 6
⟹ 36 − 12𝑥2 + 4𝑥2 = 24
⟹ 𝑥1 = 6 − 2𝑥2
Graph ⟹ 36 − 24 = 8𝑥2
⟹ 𝑥2 = 1.5

𝑥1 = 6 − 2 × 1.5
6𝑥1 + 4𝑥2 = 24 ⟹ 𝑥1 = 3

𝑧 = 5 × 3 + 4 × 1.5
𝑥1 + 2𝑥2 = 6 = 21

Optimal Point: 𝑥1 = 3; 𝑥2 =1.5; z=$21,000

Characteristics of LP Models
Formulating LP Models
Formulating linear programming models involves the following steps:

1. Define the decision variables.

2. Determine the objective function.
3. Identify the constraints.
4. Use this information to build a model.
5. Validate the model.
x1 = quantity of server model 1
to produce
x2 = quantity of server model 2
to produce

Maximize, Z = 60x1+50x2

Subject to:
Graph
Graph
Graph
Graph
Graph
Slack
Minimization Problem
Determine the values of decision variables x1 and x2 that will yield
the minimum cost in the following problem. Solve using the
objective function approach.
Graph