FORMULATION OF LPP MODELS

Use the following inequality symbols for the following words /phrases

Use the symbol ≤ Use the symbol ≥

has More than
available At least
No more than exceeds
Do not exceed Minimum of
Maximum of
EXAMPLE # 1
Blooms Corporation makes two floral products, basket of flowers and bouquet. The process of making these
products are similar that both require certain amount of flowers and ribbon. A basket of flower needs 24 pieces
of flowers and 2 yards of ribbon; a bouquet needs 12 pieces of flowers and 1 yard of ribbon. In addition to that,
basket of flowers needs 1 basket and bouquet needs 2 wrappers. There are 600 pieces of different flowers
available. 90 yards of ribbon, 60 wrappers and 30 baskets may be used. The basket of flowers may be sold for
a profit of 900 pesos and the bouquet yields a profit of 500 pesos. How many basket and bouquet of flowers
are needed to be produced, to obtain the maximum profit?

A. Decision Variables:

B. OBJECTIVE FUNCTION:
C. CONSTRUCT THE TABLE
MATERIALS X Y
flowers 24 12 ≤ 600
ribbon 2 1 ≤ 90
basket 1 ≤ 30
wrapper 2 ≤ 60
PROFIT 900 500

D. LINEAR PROGRAMMING PROBLEM MODEL:

Subject to:
24x + 12y ≤ 600
2x + y ≤ 90
x ≤ 30
2y ≤ 60
EXAMPLE # 2

The Shine Bright Inc., a manufacturer of toothpaste produce two kinds of toothpaste, one is anti-decay
toothpaste and the other is whitening toothpaste and each is produced using machines. Machine I has a
maximum of 120 hours available and Machine II has maximum of 180 hours. In making anti-decay toothpaste
requires 6 hours in Machine I and 3 hours in Machine II. The whitening toothpaste requires 4 hours in Machine
I and 10 hours in Machine II. If the profit for Anti-decay toothpaste is Php 38.00 and Php 45.00 for whitening
toothpaste, determine how many anti-decay and whitening toothpaste should be produced to maximize profit
considering the total number of both products must not exceed 240 units.

A. Decision Variables:

B. OBJECTIVE FUNCTION:
C. TABLE
Anti-decay Whitening
X Y

Machine 1 6 4 ≤ 120
Machine 2 3 10 ≤180
Profit Ph 38.00 Ph 45.00

D. LINEAR PROGRAMMING PROBLEM MODEL (LPP)

Objective Function: Max P = 38x + 45y
Subject to:
6x + 4y ≤ 120
3x + 10y ≤ 180
x ≤ 240
y ≤ 240
x≥0
y≥0
EXAMPLE # 3
There are 4 products that should be produced during the next season. Production of each requires a
given amount of production time on each of three machines. Determine a product-mix so as to
minimize cost while considering constraints related to the limited production capacity of machines.
Refer to the table for the constraints.

A. Decision variables Production Production time

  time per unit (hrs)   available

  Product   per week  

Machine for A B C D      
Rolling 1.6 2 1.3 2.3   28  
Cutting 1.1 2.4 1.6 2.5   34  
Welding 1.5 1.2 1.5 0.08   21  
B. Objective Function Cost per unit 25 34 24 36      

𝑴𝒊𝒏𝒊𝒎𝒊𝒛𝒆 𝑪=𝟐𝟓 𝒙𝟏 +𝟑𝟒 𝒙 𝟐+𝟐𝟒 𝒙𝟑 +𝟑𝟔 𝒙 𝟒

C. LPP MODEL

Subject to: