INTRODUCTION TO LINEAR PROGRAMMING MODEL

Objective:
At the end of the lesson you should be able to:
1. Create Linear Programming Model (LP Model) represented in problem.
2. Graph the LP Model.
3. Identify the feasible region of the graph in the LP Model.
4. Solve business related problems through linear programming model.

Mathematical Model

- Designed to solve real world problems in business and economics

Linear Programming

- Consists of a linear objective function

Objective Function

- The linear function which expresses the objective of the problem (either to maximize the
profit or minimized the costs)
- The aim of which is to maximize or minimize a certain function subject to certain
constraints in the form of linear equations or inequalities.

Classification of Constraints:

1. Structural Constraints
2. Non-negativity Constraints

Structural Constraints – are those which expressly sets out the restrictions of the
problem according to the availability or limitations of certain resources.

Non-negativity Constraints – the variables not permissible to be negative, otherwise

known as implied constraints.

If we state the objective function together with the structural constraints and the non-
negativity constraints then the system so formed will be called an LP MODEL (LINEAR
PROGRAMMING MODEL).
 Example. (PRODUCTION PROBLEM)

The Dacua Furniture Corporation produces two products; tables and chairs which must
be processed through two departments, namely the assembly and finishing departments.
The daily production schedule dictates that the assembly department is available for 48
hours a week while the finishing department can handle the work up to 60 hours.
Manufacturing one table requires 2 hours in the assembly department and 4 hours in the
finishing, while each chair requires 4 hours in the assembly department and 2 hours in the
finishing department. If profit per table is Php8 and Php6 per chair, find the best
combination of tables and chairs that must be produced in order to sell and realize a
maximum profit.

Solution.

1. Summarized the given information

Department Table Chair Availability Resources

Assembly 2 hrs 4 hrs 48 hrs
Finishing 4 hrs 2 hrs 60 hrs
Profit Php 8 Php 6

2. Decision variable:

T – the number of tables to be produced

C – the number of chairs to be produced

Then,

8T – profit of producing T tables

6C – profit of producing C chairs

Thus,

If we will express that profit as a linear function

Then,

Now, since our goal is to maximize the profit of producing tables and chairs. Then the desired
objective function is;
This can be obtained if the following constraints must be satisfied:

a. Assembly department is available for 48 hours per production period. If we will produce
T tables and C chairs. Then, the total number of hours

b. Finishing department

c. Since T and C counts the number of tables and chairs. Then

and

Thus, the corresponding LP Model is:

Objective Fcn: 𝑀𝑎𝑥 𝑍 𝑇 𝐶

subject to (s.t.)
𝑇 𝐶
𝑇 𝐶
𝑇
𝐶
GRAPHICAL SOLUTIONS OF LINEAR PROGRAMMING MODELS

Steps in solving an LP Model using Graphical Method:

1. Sketch the graph of each equation or inequality involved in the structural constraints on
the first quadrant.

2. Find all the corner points (vertices) of the feasible region (the region which is common
to all those defined by the equation/inequality of the structural constraints.

3. Evaluate the objective function at each corner point by substituting the coordinates at
the vertices of the feasible region in the objective function.

4. Find the vertex which gives the objective function a maximum or minimum value. This
can be done by selecting the highest value of the objective if it is maximization or the
lowest value if it is minimization.
Example. The LP Model of Dacua Furniture Corporation is given by:

𝑀𝑎𝑥 𝑍 𝑇 𝐶

subject to (s.t.)
𝑇 𝐶
𝑇 𝐶
𝑇

Solution.

1. Sketch our structural constraints:

X (T) Y (C)
24 0 (24,0)
0 12 (0,12)

x-int; y=0 2T+4C=48 2T+4(0)=48 2T=48 T=24

y –int; x=0 2T+4C=48 2(0)+4C=48 4C=48 C=12

X (T) Y (C)
15 0 (15,0)
0 30 (0,30)

x-int; y=0 4T+2C=60 4T+2(0)=60 4T=60 T=15

y-int; x=0 4T+2C=60 4(0)+2C=60 2C=60 C=30
 𝑥 𝑦
Test (0,0):

True

𝑥 𝑦
Test (0,0):

?
True

2. Corner points

(0,0)
(0,12)
(15,0)
(12,6) point of intersection

Solution for the point of intersection

By Elimination Method:
 We choose to eliminate x by 2E1 – E2 :

2E1 :

2E1 – E2 :

______________________
  To solve for x substitute to any equations E1 or E2

E1:

 Thus the point of intersection is (12,6)

3. The objective Function is . Substitute the corner points to our

objective function.

Corner Points Profit Z

(0,0) 0
(0,12) 72
(15,0) 120
(12,6) 132 Maximum

Therefore, Dacua Furniture Corporation must be produced 12 Tables and 6 Chairs in

order to have a maximum profit.

𝑀𝑎𝑥 𝑍 𝑇 𝐶

subject to (s.t.

𝑇 𝐶 2(12)+4(6)=48

𝑇 𝐶 4(12)+2(6)=60
𝑇
𝐶
Assignment: (HEALTH CARE PROBLEM)

Andrew, who is ill, takes vitamin pills. Each day, he must take at least 16 units of
Enervon X, at least 5 units of Enervon Y, and at least 20 units of Enervon Z. He can choose
between tablets and capsules. Each tablet contains 8 units of Enervon X, 1 unit of Enervon Y,
and 2 units of Enervon Z, while each capsule contains 2 units of Enervon X, 1 unit of Enervon Y
and 7 units of Enervon Z. The cost per tablet is Php15, and Php30 per capsule. How many
tablets and capsules should he buy in order to minimize his cost?