UNIT VI:

LINEAR
PROGRAMMING
SLIDESMANIA.COM
 LINEAR PROGRAMMING
⬤ A model consisting of linear relationships
representing a firm’s objective and resource
constraints.

⬤ Linear Programming problem involves a linear

objective functions, which is the function that
must be maximized or minimized. This objective
function is subject to some constraints, which are
inequalities or equations that restrict the values
of the variables.
SLIDESMANIA.COM
 LINEAR PROGRAMMING
is a method of dealing with
decision problems that can
be expressed as constrained
linear models. It is a
mathematical technique for
finding the best uses of
organization’s resources.
George Dantzig
SLIDESMANIA.COM
 Definition of Terms
Linear Equation Linear Inequality
A linear equation in two A linear inequality in two
variables, x and y, is an variables, x and y, is an
equation that can be written inequality that can be written
in the form 𝑎𝑥 + 𝑏𝑦 = 𝑐 where in the form 𝑎𝑥 + 𝑏𝑦 > 𝑐 (or
a, b, and c are constants. with <, ≥, ≤ instead of =). A
Such equation is referred to linear inequality is the result
as linear equation because of replacing linear equation
its graph is a line. equal symbol with an
SLIDESMANIA.COM

inequality symbol.
 Definition of Terms
Constraints
Optimization The restrictions of the given
Maximizing or minimizing a problem.
quantity
Corner Principle
The maximum and the
Objective Function
minimum values of the
A function that mathematically objective function occur at
describes the profit. the corner points of the
region of possible solutions if
SLIDESMANIA.COM

that region is bounded.

 Linear Programming Model
Max/Min 𝑧 = 𝑐1 𝑥1 + 𝑐2 𝑥2 + … + 𝑐𝑛 𝑥𝑛 Objective Function

Subject to:
𝑎11 𝑥1 + 𝑎12 𝑥2 + … + 𝑎1𝑛 𝑥𝑛 (≤, =, ≥)𝑏1
𝑎21 𝑥1 + 𝑎22 𝑥2 + … + 𝑎2𝑛 𝑥𝑛 (≤, =, ≥)𝑏2
. .
Constraints
. .
. .
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 + … + 𝑎𝑚𝑛 𝑥𝑛 (≤, =, ≥)𝑏𝑚
SLIDESMANIA.COM
 Graph of Linear Equation and
Linear Inequality
𝒙+𝒚=𝟑 𝒙+𝒚>𝟑
SLIDESMANIA.COM
 Graph of Linear Equation and
Linear Inequality
𝟐𝒙 + 𝟑𝒚 = 𝟏𝟐 𝟐𝒙 + 𝟑𝒚 ≤ 𝟏𝟐
SLIDESMANIA.COM
 The Geometry of Linear Programming
The word “programming” means producing a plan or
procedure that determines the solution to a problem.
Graphical Solution Method is a two-dimensional geometric
analysis of Linear Programming problems with two
decision variables. The Theory of Linear Programming
states that the optimal solution will lie at a corner point of
the feasible region.
SLIDESMANIA.COM
 Example
Consider the LP Model:
Max 𝒛 = 𝟑𝟎𝒙 + 𝟒𝟎𝒚
Subject to:
a. Shade the feasible region
𝒙+𝒚≤𝟓
b. Determine the corner points
𝟐𝒙 + 𝟑𝒚 ≥ 𝟔
c. Formulate Decision
𝒙≥𝟏
𝒙≥𝟎
𝐲≥𝟎
SLIDESMANIA.COM
 Max z = 𝟑𝟎𝒙 + 𝟒𝟎𝒚
Subject to:
𝒙+𝒚≤𝟓
𝟐𝒙 + 𝟑𝒚 ≥ 𝟔
𝒙≥𝟏
𝒙≥𝟎
𝐲≥𝟎
SLIDESMANIA.COM
 Max 𝒛 = 𝟑𝟎𝒙 + 𝟒𝟎𝒚
Subject to:
𝒙+𝒚≤𝟓
𝟐𝒙 + 𝟑𝒚 ≥ 𝟔
𝒙≥𝟏
𝒙≥𝟎
𝐲≥𝟎
SLIDESMANIA.COM
 Max 𝒛 = 𝟑𝟎𝒙 + 𝟒𝟎𝒚
Subject to:
(3,0) → 𝟑𝟎 𝟑 + 𝟒𝟎 𝟎 = 𝟗𝟎
𝒙+𝒚≤𝟓
(5,0) → 𝟑𝟎 𝟓 + 𝟒𝟎 𝟎 = 𝟏𝟓𝟎
𝟐𝒙 + 𝟑𝒚 ≥ 𝟔
(1,4) → 𝟑𝟎 𝟏 + 𝟒𝟎 𝟒 = 𝟏𝟗𝟎
𝒙≥𝟏 𝟒
𝒙≥𝟎 (1,4/3) → 𝟑𝟎 𝟏 + 𝟒𝟎 = 𝟖𝟑. 𝟑𝟑
𝟑
𝐲≥𝟎
Optimal Solution
Corner Points x=1
(3,0) y=4
(5,0) z = 190
(1,4)
SLIDESMANIA.COM

(1,4/3)
 5 steps in solving Linear
Programming problems
STEP 1: List the independent variables.
STEP 2: List the constraints and translate them into
linear inequality.
STEP 3: Set the objective function and translate it into
linear equation.
STEP 4: Graph the feasible region.
STEP 5: Find all the corner points and the z-value
SLIDESMANIA.COM

associated with these points.

 Example
A craftsman produces two products: coffee tables and end
tables. Production of one coffee table requires six hours of
his labor, and the materials cost him Php200. Production of
one end table requires five hours of labor, and the
materials cost him Php100. The craftsman wants to work no
more than 40 hours each week, and his financial resources
allow him to pay no more than Php1,000 for materials each
week. If he can sell as many tables as he can make and if
his profit is Php240 per coffee table and Php160 per end
table, how many coffee tables and how many end tables
SLIDESMANIA.COM

should he make each week to maximize weekly profit?

 A craftsman produces two products: coffee tables and end tables. Production of one coffee table
requires six hours of his labor, and the materials cost him Php200. Production of one end table
requires five hours of labor, and the materials cost him Php100. The craftsman wants to work no
more than 40 hours each week, and his financial resources allow him to pay no more than
Php1,000 for materials each week. If he can sell as many tables as he can make and if his profit
is Php240 per coffee table and Php160 per end table, how many coffee tables and how many
end tables should he make each week to maximize weekly profit?

Step 1: List the independent variables.

Let x be the number of coffee tables made each week
Let y be the number of end tables made each week
SLIDESMANIA.COM
 A craftsman produces two products: coffee tables and end tables. Production of one coffee table
requires six hours of his labor, and the materials cost him Php200. Production of one end table
requires five hours of labor, and the materials cost him Php100. The craftsmans want to work no
more than 40 hours each week, and his financial resources allow him to pay no more than
Php1,000 for materials each week. If he can sell as many tables as he can make and if his profit
is Php240 per coffee table and Php160 per end table, how many coffee tables and how many
end tables should he make each week to maximize weekly profit?
STEP 2: List the constraints and translate
them into linear inequality.
Production (hours) Cost (Php)
Coffee Tables (x) 6 hours Php200
End Tables (y) 5 hours Php100
SLIDESMANIA.COM

Total per week No more than 40 hours No more than Php1,000

 STEP 2: List the constraints and translate
them into linear inequality.
Production (hours) Cost (Php)
Coffee Tables (x) 6 hours Php200
End Tables (y) 5 hours Php100
Total per week No more than 40 hours No more than Php1,000

Subject to: 𝟔𝒙 + 𝟓𝒚 ≤ 𝟒𝟎 𝟐𝟎𝟎𝒙 + 𝟏𝟎𝟎𝒚 ≤ 𝟏𝟎𝟎𝟎

𝒙≥𝟎
SLIDESMANIA.COM

𝒚≥𝟎
 A craftsman produces two products: coffee tables and end tables. Production of one coffee table
requires six hours of his labor, and the materials cost him Php200. Production of one end table
requires five hours of labor, and the materials cost him Php100. The craftsman want to work no
more than 40 hours each week, and his financial resources allow him to pay no more than
Php1,000 for materials each week. If he can sell as many tables as he can make and if his profit
is Php240 per coffee table and Php160 per end table, how many coffee tables and how many
end tables should he make each week to maximize weekly profit?
STEP 3: Set the objective function and
translate it into linear equation.

Production Cost
Production Profit
Cost
Coffee Tables
Coffee (x) (x) 6 hours
Tables Php200 Php240
EndEnd
Tables (y) (y)
Tables 5 hours Php100 Php160
SLIDESMANIA.COM

Total per per

Total weekweek No more than 40 No more than
z
hours Php1,000
 STEP 3: Set the objective function and
translate it into linear equation.

Production Cost Profit

Coffee Tables (x) 6 hours Php200 Php240
End Tables (y) 5 hours Php100 Php160
Total per week No more than 40 No more than
z
hours Php1,000
Production Cost
Coffee Tables (x) 𝒛 = 𝟐𝟒𝟎𝒙 + 𝟏𝟔𝟎𝒚

End Tables (y)

SLIDESMANIA.COM

Total per week

 A craftsman produces two products: coffee tables and end tables. Production of one coffee table
requires six hours of his labor, and the materials cost him Php200. Production of one end table
requires five hours of labor, and the materials cost him Php100. The craftsman want to work no
more than 40 hours each week, and his financial resources allow him to pay no more than
Php1,000 for materials each week. If he can sell as many tables as he can make and if his profit
is Php240 per coffee table and Php160 per end table, how many coffee tables and how many
end tables should he make each week to maximize weekly profit?

STEP 4: Graph the feasible region.

Max: 𝒛 = 𝟐𝟒𝟎𝒙 + 𝟏𝟔𝟎𝒚

Production
Subject to:
𝟔𝒙 + 𝟓𝒚 ≤ 𝟒𝟎 𝒙≥𝟎
SLIDESMANIA.COM

𝟐𝟎𝟎𝒙 + 𝟏𝟎𝟎𝒚 ≤ 𝟏𝟎𝟎𝟎 𝒚≥𝟎

 Max: 𝒛 = 𝟐𝟒𝟎𝒙 + 𝟏𝟔𝟎𝒚
Subject to:
𝟔𝒙 + 𝟓𝒚 ≤ 𝟒𝟎
𝟐𝟎𝟎𝒙 + 𝟏𝟎𝟎𝒚 ≤ 𝟏𝟎𝟎𝟎
𝒙≥𝟎
𝒚≥𝟎
SLIDESMANIA.COM
 Max: 𝒛 = 𝟐𝟒𝟎𝒙 + 𝟏𝟔𝟎𝒚
Subject to:
𝟔𝒙 + 𝟓𝒚 ≤ 𝟒𝟎
𝟐𝟎𝟎𝒙 + 𝟏𝟎𝟎𝒚 ≤ 𝟏𝟎𝟎𝟎
𝒙≥𝟎
𝒚≥𝟎
SLIDESMANIA.COM
 Max: 𝒛 = 𝟐𝟒𝟎𝒙 + 𝟏𝟔𝟎𝒚 (0,8) → 240 0 + 160 8 = 1280
Subject to: (5,0) →240 5 + 160 0 = 1200
𝟔𝒙 + 𝟓𝒚 ≤ 𝟒𝟎 (0,0) →240 0 + 160 0 = 0
𝟐𝟎𝟎𝒙 + 𝟏𝟎𝟎𝒚 ≤ 𝟏𝟎𝟎𝟎 (2.5,5) →240 2.5 + 160 5 = 1400
𝒙≥𝟎 Optimal Solution
𝒚≥𝟎 x = 2.5
y=5
Corner Points z = 1,400
(0,8)
(5,0) The maximum profit is possible when
(0,0) the craftsman makes
3 number of Coffee tables and 5 end
SLIDESMANIA.COM

(2.5,5)
tables yielding to a profit of Php1400.
 Example
A local boutique produced two designs of gowns, Design A
and Design B and has the following materials available: 18
square meters of cotton, 20 square meters of silk, and 5
square meters of wool. Design A requires the following: 3
square meters of cotton, 2 square meters of silk, and 1
square meter of wool. Design B requires the following: 2
square meters of cotton and 4 square meters of silk. If
Design A sells for Php1200 and Design B for Php1600, how
many of each designs should the boutique produce to obtain
a maximum amount of money?
SLIDESMANIA.COM
 A local boutique produced two designs of gowns, Design A and Design B and has
the following materials available: 18 square meters of cotton, 20 square meters of
silk, and 5 square meters of wool. Design A requires the following: 3 square
meters of cotton, 2 square meters of silk, and 1 square meter of wool. Design B
requires the following: 2 square meters of cotton and 4 square meters of silk. If
Design A sells for Php1200 and Design B for Php1600, how many of each designs
should the boutique produce to obtain a maximum amount of money?

Step 1: List the independent variables.

Let x be the number of Design A should the boutique must produce

Let y be the number of Design B should the boutique must produce
SLIDESMANIA.COM
 A local boutique produced two designs of gowns, Design A and Design B and has the
following materials available: 18 square meters of cotton, 20 square meters of silk, and
5 square meters of wool. Design A requires the following: 3 square meters of cotton, 2
square meters of silk, and 1 square meter of wool. Design B requires the following: 2
square meters of cotton and 4 square meters of silk. If Design A sells for Php1200 and
Design B for Php1600, how many of each designs should the boutique produce to obtain
a maximum amount of money?
STEP 2: List the constraints and translate
them into linear inequality.

Cotton Silk Wool

Design A (x) 3 square meters 2 square meters 1 square meter
Design B (y) 2 square meters 4 square meters 0 square meter
SLIDESMANIA.COM

Available materials 18 square meters 20 square meters 5 square meters

 STEP 2: List the constraints and translate
them into linear inequality.

Cotton Silk Wool

Design A (x) 3 square meters 2 square meters 1 square meter

Design B (y) 2 square meters 4 square meters 0 square meter

Available materials 18 square meters 20 square meters 5 square meters

Subject to: 𝟑𝒙 + 𝟐𝒚 ≤ 𝟏𝟖 𝟐𝒙 + 𝟒𝒚 ≤ 𝟐𝟎 𝒙≤𝟓

𝒙≥𝟎
SLIDESMANIA.COM

𝒚≥𝟎
 A local boutique produced two designs of gowns, Design A and Design B and has the
following materials available: 18 square meters of cotton, 20 square meters of silk, and
5 square meters of wool. Design A requires the following: 3 square meters of cotton, 2
square meters of silk, and 1 square meter of wool. Design B requires the following: 2
square meters of cotton and 4 square meters of silk. If Design A sells for Php1200 and
Design B for Php1600, how many of each designs should the boutique produce to obtain
a maximum amount of money?
STEP 3: Set the objective function and
translate it into linear equation.
Cotton Production
Silk Wool CostPrice
Coffee
Design A (x) Tables
3 (x)
sq. m 2 sq. m 1 sq. m Php1,200

DesignEnd
B (y) Tables2(y)
sq. m 4 sq. m 0 sq. m Php1,600
SLIDESMANIA.COM

Total per week

Available
18 sq. m 20 sq. m 5 sq. m z
materials
 STEP 3: Set the objective function and
translate it into linear equation.
Cotton Silk Wool Price

Design A (x) 3 sq. m 2 sq. m 1 sq. m Php1,200

Design B (y) 2 sq. m 4 sq. m 0 sq. m Php1,600

Available
18 sq. m 20 sq. m
Production 5 sq. m Cost z
materials

Coffee Tables (x) 𝒛 = 𝟏𝟐𝟎𝟎𝒙 + 𝟏𝟔𝟎𝟎𝒚

End Tables (y)
SLIDESMANIA.COM
 A local boutique produced two designs of gowns, Design A and Design B and has the
following materials available: 18 square meters of cotton, 20 square meters of silk, and
5 square meters of wool. Design A requires the following: 3 square meters of cotton, 2
square meters of silk, and 1 square meter of wool. Design B requires the following: 2
square meters of cotton and 4 square meters of silk. If Design A sells for Php1200 and
Design B for Php1600, how many of each designs should the boutique produce to obtain
a maximum amount of money?
STEP 4: Graph the feasible region.

Max: 𝒛 = 𝟏𝟐𝟎𝟎𝒙 + 𝟏𝟔𝟎𝟎𝒚

Production
Subject to:
𝟑𝒙 + 𝟐𝒚 ≤ 𝟏𝟖 𝒙≥𝟎
𝟐𝒙 + 𝟒𝒚 ≤ 𝟐𝟎 𝒚≥𝟎
SLIDESMANIA.COM

𝒙≤𝟓
 Max: 𝒛 = 𝟏𝟐𝟎𝟎𝒙 + 𝟏𝟔𝟎𝟎𝒚
Subject to:
𝟑𝒙 + 𝟐𝒚 ≤ 𝟏𝟖
𝟐𝒙 + 𝟒𝒚 ≤ 𝟐𝟎
𝒙≤𝟓
𝒙≥𝟎
𝒚≥𝟎
SLIDESMANIA.COM
 Max: 𝒛 = 𝟏𝟐𝟎𝟎𝒙 + 𝟏𝟔𝟎𝟎𝒚
Subject to:
𝟑𝒙 + 𝟐𝒚 ≤ 𝟏𝟖
𝟐𝒙 + 𝟒𝒚 ≤ 𝟐𝟎
𝒙≤𝟓
𝒙≥𝟎
𝒚≥𝟎
SLIDESMANIA.COM
 Max: 𝒛 = 𝟏𝟐𝟎𝟎𝒙 + 𝟏𝟔𝟎𝟎𝒚
Subject to:
𝟑𝒙 + 𝟐𝒚 ≤ 𝟏𝟖
𝟐𝒙 + 𝟒𝒚 ≤ 𝟐𝟎
𝒙≤𝟓
𝒙≥𝟎
𝒚≥𝟎
SLIDESMANIA.COM
 Max: 𝒛 = 𝟏𝟐𝟎𝟎𝒙 + 𝟏𝟔𝟎𝟎𝒚 (0,0) → 1,200 0 + 1,600 0 = 0
Subject to: (5,0) →1,200 5 + 1,600 0 = 6,000
𝟑𝒙 + 𝟐𝒚 ≤ 𝟏𝟖 (0,5) →1,200 0 + 1,600 5 = 8,000
𝟐𝒙 + 𝟒𝒚 ≤ 𝟐𝟎 (5,1.5) →1,200 5 + 1,600 1.5 = 8,400
𝒙≤𝟓 (4,3) → 1,200 4 + 1,600 3 = 9,600
𝒙≥𝟎
𝒚≥𝟎 Optimal Solution
x=4
Corner Points y=3
(0,0) z = 9,600
(5,0)
(0,5) The maximum amount of money that a
SLIDESMANIA.COM

(5,1.5) boutique can obtain is Php9600 by

(4,3) making 4 Design A and 3 Design B.
 Example
A vegetable farmer in Rizal ships at most 900 baskets of
vegetables on a freight truck daily to a certain Quezon City
Public Market. He must ship at least 550 baskets of lettuce
and at most 200 baskets of celery. Furthermore, his profits
are Php200 per basket of lettuce and Php225 per basket of
celery. How many number of baskets of lettuce and celery
he should be loading the freight truck in order to maximize
his profit?
SLIDESMANIA.COM
 A vegetable farmer in Rizal ships at most 900 baskets of vegetables on a
freight truck daily to a certain Quezon City Public Market. He must ship at least
550 baskets of lettuce and at most 200 baskets of celery. Furthermore, his
profits are Php200 per basket of lettuce and Php225 per basket of celery. How
many number of baskets of lettuce and celery he should be loading the freight
truck in order to maximize his profit?

Step 1: List the independent variables.

Let x be the number of baskets of lettuce should the vegetable farmer
must load in the freight truck.
Let y be the number of baskets of celery should the vegetable farmer
must load in the freight truck.
SLIDESMANIA.COM
 A vegetable farmer in Rizal ships at most 900 baskets of vegetables on a
freight truck daily to a certain Quezon City Public Market. He must ship at least
550 baskets of lettuce and at most 200 baskets of celery. Furthermore, his
profits are Php200 per basket of lettuce and Php225 per basket of celery. How
many number of baskets of lettuce and celery he should be loading the freight
truck in order to maximize his profit?
STEP 2: List the constraints and translate
them into linear inequality.
Number of baskets of vegetables

Number of baskets of lettuce (x) At least 550 baskets

Number of baskets of celery (y) At most 200 baskets
SLIDESMANIA.COM

Total Number of baskets At most 900 baskets

 STEP 2: List the constraints and translate
them into linear inequality.
Number of baskets of vegetables

Number of baskets of lettuce (x) At least 550 baskets

Number of baskets of celery (y) At most 200 baskets

Total Number of baskets At most 900 baskets

Subject to: 𝒙 ≥ 𝟓𝟓𝟎 𝒚 ≤ 𝟐𝟎𝟎 𝒙 + 𝒚 ≤ 𝟗𝟎𝟎

𝒙 ≤ 𝟗𝟎𝟎 𝒚≥𝟎 𝒙+𝒚≥𝟎
SLIDESMANIA.COM
 A vegetable farmer in Rizal ships at most 900 baskets of vegetables on a
freight truck daily to a certain Quezon City Public Market. He must ship at least
550 baskets of lettuce and at most 200 baskets of celery. Furthermore, his
profits are Php200 per basket of lettuce and Php225 per basket of celery. How
many number of baskets of lettuce and celery he should be loading the freight
truck in order to maximize his profit?
STEP 3: Set the objective function and
translate it into linear equation.

Production
Number of baskets of vegetables Cost Profit
Coffee
Number Tables
of baskets (x) (x)
of lettuce At least 550 baskets Php200
NumberEnd Tablesof(y)
of baskets celery (y) At most 200 baskets Php225
SLIDESMANIA.COM

TotalTotal perofweek
Number baskets At most 900 baskets z
 STEP 3: Set the objective function and
translate it into linear equation.
Number of baskets of vegetables Profit

Number of baskets of lettuce (x) At least 550 baskets Php200

Number of baskets of celery (y) At most 200 baskets Php225

Total Number of baskets At most 900 baskets

Production Cost z
Coffee Tables (x) 𝒛 = 𝟐𝟎𝟎𝒙 + 𝟐𝟐𝟓𝒚
End Tables (y)
SLIDESMANIA.COM

Total per week

 A vegetable farmer in Rizal ships at most 900 baskets of vegetables on a
freight truck daily to a certain Quezon City Public Market. He must ship at least
550 baskets of lettuce and at most 200 baskets of celery. Furthermore, his
profits are Php200 per basket of lettuce and Php225 per basket of celery. How
many number of baskets of lettuce and celery he should be loading the freight
truck in order to maximize his profit?

STEP 4: Graph the feasible region.

Max: 𝒛 = 𝟐𝟎𝟎𝒙 + 𝟐𝟐𝟓𝒚

Production
Subject to:
𝒙 ≥ 𝟓𝟓𝟎 𝒚 ≤ 𝟐𝟎𝟎 𝒙 + 𝒚 ≤ 𝟗𝟎𝟎
𝒙 ≤ 𝟗𝟎𝟎 𝒚≥𝟎 𝒙+𝒚≥𝟎
SLIDESMANIA.COM
 Max: 𝒛 = 𝟐𝟎𝟎𝒙 + 𝟐𝟐𝟓𝒚
Subject to:
𝒙 ≥ 𝟓𝟓𝟎
𝒙 ≤ 𝟗𝟎𝟎
𝒚 ≤ 𝟐𝟎𝟎
𝒚≥𝟎
𝒙 + 𝒚 ≤ 𝟗𝟎𝟎
𝒙+𝒚≥𝟎
SLIDESMANIA.COM
 Max: 𝒛 = 𝟐𝟎𝟎𝒙 + 𝟐𝟐𝟓𝒚
Subject to:
𝒙 ≥ 𝟓𝟓𝟎 𝒚 ≤ 𝟐𝟎𝟎
𝒙 ≤ 𝟗𝟎𝟎 𝒚 ≥ 𝟎
𝒙 + 𝒚 ≤ 𝟗𝟎𝟎 𝒙 + 𝒚 ≥ 𝟎
SLIDESMANIA.COM
 Max: 𝒛 = 𝟐𝟎𝟎𝒙 + 𝟐𝟐𝟓𝒚
Subject to: (550,0) → 200 550 + 225 0 = 110,000
𝒙 ≥ 𝟓𝟓𝟎 𝒚 ≤ 𝟐𝟎𝟎 (900,0) →200 900 + 225 0 = 180,000
(700,200) →200 700 + 225 200 = 185,000
𝒙 ≤ 𝟗𝟎𝟎 𝒚 ≥ 𝟎
(550,200) →200 550 + 225 200 = 155,000
𝒙 + 𝒚 ≤ 𝟗𝟎𝟎 𝒙 + 𝒚 ≥ 𝟎
Optimal Solution
x = 700
y = 200
Corner Points
z = 185,000
(550,0)
(900,0) The vegetable farmer needs to ship
(700,200) 700 baskets of lettuce and 200 baskets
SLIDESMANIA.COM

(550,200) of celery in order to reach the

maximum profit of Php185,000.