16

LINEAR PROGRAMMING

CONTENTS
A Linear Programming Problem 204
Steps in Solving a LP problem 205
Graphical Method 205
Steps in the Graphical Method 205
Matrix Method 213

A L I NE A R P R O G R A M M I NG P R O B LE M
Linear Programming (LP) is an optimization technique used to maximize or
minimize a linear function (usually profit or cost of production), subject to a set
of constraints. It was developed by Leonid Kantorovich around the time of
WWII. LP is a special case of mathematical programming (also called
mathematical optimization). Mathematical Programming is the use of
mathematical models in the optimum allocation of limited resources among
competing activities, under a set of constraints. There are well-known successful
applications in engineering (for shape optimisation), efficient manufacturing
(for maximisation of profit), energy industry (for optimisation of the electric
power system), and transportation optimisation (for cost and time efficiency).
The standard form of a LP problem consists of the following three parts:

A linear function to be maximized/minimized

e.g. 𝑍 = 𝑐1 𝑥1 + 𝑐2 𝑥2

Problem constraints of the following form

𝑎11 𝑥1 + 𝑎12 𝑥2 ≤ 𝑏1
e.g.
𝑎21 𝑥1 + 𝑎22 𝑥2 ≤ 𝑏2

Non-negativity restrictions
e.g. 𝑥1 ≥ 0, 𝑥2 ≥ 0

where the objective function, Z, is the expression to be maximized or

minimized; x represents the variables to be determined; a, c and b are constants.
The inequalities are the constraints over which the objective function is to be
Chapter 16| Linear Programming 205

optimized. The non-negativity restriction of all the variables is a condition

always implicit in the methods of solution in LP.

Steps in Solving a LP problem

If the problem is not a word/story problem, skip to step 5.

1. Identify the decision variables (e.g., 𝑥1 , 𝑥2 ). Decision variables describe

the quantities that the decision makers would like to determine. They are
the unknowns of a LP problem.
2. Write the objective function represented by Z. The objective function is
the function whose value is to be either minimized or maximized (e.g., 𝑍 =
𝑥1 + 𝑥2 ).
3. State the constraints (e.g., 𝑥1 + 𝑥2 ≥ 1). The constraints are the
restrictions or limitations on the decision variables.
4. Note the non-negativity restriction (e.g., 𝑥1 ≥ 0, 𝑥2 ≥ 0). Non-negativity
restriction indicates that all decision variables must take on values equal
to or greater than zero.
5. Solve the LP problem. The most popular methods are graphical, matrices
and simplex method.

G R A PH IC A L M E T H O D
If a LP problem has two decision variables, the graphical method can find the
optimal solution. In this method, the inequalities are plotted in the XY graph
where the intersecting region forms the feasible region. The feasible region
provides the optimal solution.
In the graphical method, the fundamental theorem of LP or the corner
point theorem is important.

The fundamental theorem of LP or the corner

point theorem states that, if a LP problem is feasible,
the maximum or minimum value will occur at a corner
point, or on a line segment between two corner points.

To find the optimal values in the feasible region, we test the corner points. Any
corner point that provides the largest value for the objective function is the
maximum; any corner point that provides the smallest value for the objective
function is the minimum.

Steps in the Graphical Method:

1. Formulate the LP problem.
2. Graph the inequalities: locate the feasible region and the corner points.
3. Determine the value of the objective function at each corner point.
4. Identify the optimum point.

 EXAMPLE 16.1
Solve the following LP problem using the graphical method:
𝑥1 + 2𝑥2 ≥ 12
Min 𝐶 = 2𝑥1 + 𝑥2 subject to {1.5𝑥1 + 𝑥2 ≥ 8 𝑥1 ≥ 0, 𝑥2 ≥ 0
3𝑥1 + 𝑥2 ≥ 11
206 Olaniyi Evans | University Mathematics

S O L U T I O N tips
First graph the inequalities. Find two solutions, preferably the 𝑥1 -intercepts and
𝑥2 -intercepts of the graph, by setting first 𝑥1 = 0 and then 𝑥2 = 0.
𝒙𝟏 + 𝟐𝒙𝟐 = 𝟏𝟐 𝟏. 𝟓𝒙𝟏 + 𝒙𝟐 = 𝟖 𝟑𝒙𝟏 + 𝒙𝟐 = 𝟏𝟏

𝑥1 = 0, 𝑥2 = 6 𝑥1 = 0, 𝑥2 = 8 𝑥1 = 0, 𝑥2 = 11

𝑥2 = 0, 𝑥1 = 12 𝑥2 = 0, 𝑥1 = 5.33 𝑥2 = 0, 𝑥1 = 3.67

For each inequality, plot the two points and draw a line connecting them. The
shaded area is the feasible region. The feasible region is the one which satisfies
all the inequalities.

Then find the corner points of the shaded polygon formed. A corner point is a
point in the feasible region that is the intersection of two boundary lines.
Substitute the corner points into the objective function (C) and find the smallest
value.
Corner Point 𝐶 = 2𝑥1 + 𝑥2

(0, 11) 2(0) + (11) = 11

(2, 5) 𝟐(𝟐) + (𝟓) = 𝟗

(12, 0) 2(12) + (0) = 24

The minimum value is 9 at (2, 5).
Hence, the optimal solution to the given LP problem is: 𝑥1 = 2, 𝑥2 = 5 and 𝐶 =
9.

 EXAMPLE 16.2
Fitness Engineering produces only two fitness trackers: Grandeur and Posh.
Production is limited to 20 hours per week, and the production of Grandeur
requires 2 hours while the production of Posh requires 1 hour. The firm has only
16 cubic feet of storage space and a package of Grandeur requires 1 cubic feet,
while a package of Posh requires 1 cubic feet. The demand is such that no more
than 8 packages of Grandeur can be sold each week. The management has
determined that the profit are $2.05 for each Grandeur and $1.05 for each Posh.
Chapter 16| Linear Programming 207

How many fitness trackers of each type should be produced each week in order
to maximize the total profit?
S O L U T I O N tips
First define the decision variables and the units in which they are measured. For
this problem we are interested in knowing the optimal number of packages of
each type of fitness tracker to produce per week.

Let 𝑥1 = Number of packages of Grandeur produced per week.

𝑥2 = Number of packages of Posh produced per week.

The objective function is easy to identify since the idea is to maximize the profit:
The management has determined that the profit are $2.05 for each Grandeur and
$1.05 for each Posh. Which is given by:

𝑍 = 2.05𝑥1 + 1.05𝑥2

Production is limited to 20 hours per week, and production of Grandeur requires

2 hours while production of Posh requires 1 hour. Now, the constraint imposed
on production capacity per week is:

2𝑥1 + 𝑥2 ≤ 20

The firm has only 16 cubic feet of storage space and a package of Grandeur
requires 1 cubic feet, while a package of Posh requires 1 cubic feet. Now, the
constraint on storage capacity per week is:

𝑥1 + 𝑥2 ≤ 16

The demand is such that no more than 8 packages of Grandeur can be sold each
week. Now, the constraint on demand is:
𝑥1 ≤ 8
Since the decision variables must be nonnegative,

𝑥1 ≥ 0, 𝑥2 ≥ 0

Thus, the LP is:

2𝑥1 + 𝑥2 ≤ 20
Max 𝑍 = 2.05𝑥1 + 1.05𝑥2 subject to { 𝑥1 + 𝑥2 ≤ 16 𝑥1 ≥ 0, 𝑥2 ≥ 0
𝑥1 ≤ 8

First graph the inequalities. For the first two inequalities, find two solutions,
preferably the 𝑥1 -intercepts and 𝑥2 -intercepts of the graph, by setting first 𝑥1 = 0
and then 𝑥2 = 0. For the third inequality, the graph is the horizontal line: 𝑥1 = 8.
𝟐𝒙𝟏 + 𝒙𝟐 = 𝟐𝟎 𝒙𝟏 + 𝒙𝟐 = 𝟏𝟔 𝒙𝟏 = 𝟖

𝑥1 = 0, 𝑥2 = 20 𝑥1 = 0, 𝑥2 = 16 Treat as 𝑥1 = 8

𝑥2 = 0, 𝑥1 = 10 𝑥2 = 0, 𝑥1 = 16 Here the line is parallel to Y-axis.

208 Olaniyi Evans | University Mathematics

For each inequality, plot the two points and draw a line connecting them. The
shaded area is the feasible region.

Then find the corner points of the shaded polygon formed. Substitute the corner
points into the objective function (the Z function) and find the smallest value.
Corner Point 𝑍 = 2.05𝑥1 + 1.05𝑥2

(0, 0) 2.05(0) + 1.05(0) = 0

(8, 0) 2.05(8) + 1.05(0) = 16.4

(8, 4) 2.05(8) + 1.05(4) = 20.6

(4, 12) 𝟐. 𝟎𝟓(𝟒) + 𝟏. 𝟎𝟓(𝟏𝟐) = 𝟐𝟎. 𝟖

(0, 16) 2.05(0) + 1.05(16) = 16.8

The maximum value of the objective function Z = 20.8 at (4, 12).
Hence, 4 Grandeur and 12 Posh should be produced per week in order to obtain
the maximum profit of $20.80.

 EXAMPLE 16.3
Mach100 Ltd makes two products X and Y, and has a total production capacity
of 4.5 tons per week. The firm has a contract to supply at least 1 ton of X and at
least 0.5 ton of Y per week. In production, each ton of X requires 4 machine hours
and each ton of Y requires 12 machine hours. The available number of machine
hours is 38. If the profit is $4 per ton of X and $6 per ton of Y, determine the
production schedule that yields the maximum profit.
S O L U T I O N tips
Let 𝑥 = Number of tons of X produced per week.
𝑦 = Number of tons of Y produced per week.
Chapter 16| Linear Programming 209

Thus, the LP is:

Max 𝑍 = 4𝑥 + 6𝑦
𝑥 + 𝑦 ≤ 4.5 Production capacity
subject to {𝑥 ≥ 1; 𝑦 ≥ 0.5 Supply 𝑥 ≥ 0, 𝑦 ≥ 0
4𝑥 + 12𝑦 ≤ 38 Machine hours

𝒙 + 𝒚 = 𝟒. 𝟓 𝟒𝒙 + 𝟏𝟐𝒚 = 𝟑𝟖

𝑥 = 0, 𝑦 = 4.5 𝑥1 = 0, 𝑦 = 3.17
𝑦 = 0, 𝑥 = 4.5 𝑦 = 0, 𝑥 = 9.5

Corner Point 𝐶 = 4𝑥1 + 6𝑥2

(1, 0.5) 4(1) + 6(0.5) = 7

(4, 0.5) 4(4) + 6(0.5) = 19

(2, 2.5) 𝟒(𝟐) + 𝟔(𝟐. 𝟓) = 𝟐𝟑

(1, 2.83) 4(1) + 6(2.83) = 21
The maximum value is 23 at (2, 2.5).
Hence the company should produce 2 tons of product X and 2.5 tons of product
Y in order to yield a maximum profit of $23.
210 Olaniyi Evans | University Mathematics

 EXAMPLE 16.4
A global manufacturing outfit must decide on the optimal mix of two possible
plants of which the inputs and outputs per production run are as follows:
Input (tons) Output (tons)
Plants
A B X Y
Chicago 1 0.5 1.25 2
Lagos 1 1 1 1
The maximum amounts available of input A and B are 45 tons and 30 tons,
respectively. The market conditions require the production of at least 25 tons of
X and 20 tons of Y. The profits per production run for the Chicago and Lagos
plants are $15 and $20, respectively. Determine the production run for the
Chicago and Lagos plants.
S O L U T I O N tips
Let 𝑥 = Number of production run for the Chicago plant.
𝑦 = Number of production run of the Lagos plant.
Thus, the LP is:
𝑥 + 𝑦 ≤ 45
Input
0.5𝑥 + 𝑦 ≤ 30
Max 𝑍 = 15𝑥 + 20𝑦 subject to 𝑥 ≥ 0, 𝑦 ≥ 0
1.25𝑥 + 𝑦 ≥ 25 Output
{ 2𝑥 + 𝑦 ≥ 20

𝒙 + 𝒚 = 𝟒𝟓 𝟎. 𝟓𝒙 + 𝒚 = 𝟑𝟎 𝟏. 𝟐𝟓𝒙 + 𝒚 = 𝟐𝟓 𝟐𝒙 + 𝒚 = 𝟐𝟎

𝑥 = 0, 𝑦 = 45 𝑥 = 0, 𝑦 = 30 𝑥 = 0, 𝑦 = 25 𝑥1 = 0, 𝑦 = 10
𝑦 = 0, 𝑥 = 45 𝑦 = 0, 𝑥 = 60 𝑦 = 0, 𝑥 = 20 𝑦 = 0, 𝑥 = 20
Chapter 16| Linear Programming 211

Corner Point Z = 15𝑥1 + 20𝑥2

(0, 25) 15(0) + 20(25) = 500

(0, 30) 15(0) + 20(30) = 600

(30, 15) 𝟏𝟓(𝟑𝟎) + 𝟐𝟎(𝟏𝟓) = 𝟕𝟓𝟎

(45, 0) 15(45) + 20(0) = 675
(20, 0) 15(20) + 20(0) = 300
The maximum value is 750 at (30, 15).
Hence, the company should produce 30 tons in Chicago and 15 tons in Lagos in
order to achieve the maximum profit of $750.

 WORKOUT 16.1
1. Use the graphical method to solve the following LP problem:
𝑥1 + 2𝑥2 ≥ 12
a) Min 𝐶 = 𝑥1 + 18𝑥2 subject to {0.5𝑥1 + 𝑥2 ≥ 6
𝑥1 − 𝑥2 ≥ 9
1
𝑥1 + 𝑥2 ≤ 500
2
3
b) Max 𝑍 = 𝑥1 + 3𝑥2 subject to 4 𝑥1 + 𝑥2 ≤ 600
𝑥1 + 𝑥2 ≤ 700
{ 𝑥1 − 𝑥2 ≤ 350
2. Consider i-Fashions Factory which has two designs in its garment
production line—Paradise and Garden of Eden. The following table shows
the scheduling hours per garment in each department and the capacities of
the departments, in monthly hours.
Paradise Garden of Eden Capacity
(hours) (hours) (hours/month)
Purchasing 2.1 2.1 294
Manufacturing 1.575 1.05 210
Sales 1.05 2.1 210
The management has determined that the costs are $10 for each Paradise
and $5 for each Garden of Eden. Find a production plan to minimize cost.
3. A workshop has three machines: Mini, Mega and Pro. It can manufacture
two fragrances (Luxurious and Sumptuous) which passes through each
machine in the same order: First to Mini, then to Mega and then to Pro as
shown in the following table.
Luxurious Sumptuous Capacity
(hours/gram) (hours/gram) (hours/week)
Mini 1 4 60
Mega 5 2 48
Pro 3 1 26
Profit ($/g) 1 1
212 Olaniyi Evans | University Mathematics

How many of each fragrance should be produced in order that the profit is
maximum?
4. Magnet Manufacturing owns plants in two cities: London and Washington.
The London plant costs $500 per month to operate, and it can produce 200
barrels of A oil, 300 barrels of B oil, and 500 barrels of C oil each month.
The Washington plant costs $800 per month to operate, and it can produce
100 barrels of A oil, 800 barrels of B oil, and 500 barrels of C oil each month.
The company has orders totaling 1800 barrels of A oil, 11800 barrels of B
oil, and 8000 barrels of C oil. How many months should each factory be run
to fulfill the order on hand at minimum cost?
5. Zaz is on a diet that gives her calories, protein and carbohydrate from two
food items. The diet chart is as follows:
Food A Food B
Calories (grams) 350 250
Protein (grams) 5 2
Carbohydrates (grams) 7 3
Cost $5 $3
The diet has to be planned in such a way that it would contain at least 2300
calories, 25 grams of protein, and 36 grams of carbohydrates. Find a diet
plan to minimize cost.
6. Giantez Global makes two types of shoes: Cruiser and Sophisticated. Each
pair of Cruiser requires 5 labour hours for fabricating, 2 labour hours for
finishing and 1 labour hour for sales. Each pair of Sophisticated requires 1
labour hour for fabricating, 8 labour hours for finishing and 3 labour hours
for sales. For fabricating, finishing and sales, the maximum labour hours
available are 44, 48 and 20 respectively. The company makes a profit of
$100 on each pair of shoes. How many pairs of each type of shoes should be
manufactured per week to realise a maximum profit?
7. A manufacturer must decide on the optimal mix of two production processes
of which the inputs and outputs per production run are as follows:
Input (tons) Output (tons)
Process
A B X Y
P1 3 1 2.5 3
P2 3 2 2 1.5
The maximum amounts available of input A and B are 90 tons and 40 tons,
respectively. The market conditions require the production of at least 50
tons of X and 30 tons of Y. The profits per production run for the P1 and P2
processes are $3 and $4, respectively. Determine the production run for the
two processes.
ANSWERS RAPID
1. a) 𝑥1 = 12; 𝑥2 = 0; 𝐶 = 12 b) 𝑥1 = 0; 𝑥2 = 600; 𝑍 = 1800
2. Paradise = 0. Eden = 200. C = 1000
3. Luxurious = 4. Sumptuous = 14. Z = 18
4. London = 2 months. Washington = 14 months. C = 12200
5. Food A = 3. Food B = 5. C = $30
6. Cruiser = 8, Sophisticated = 4. Z = 1200
7. 𝑋 = 20, 𝑌 = 10, 𝑍 = 100.
Chapter 16| Linear Programming 213

M A TR IX M E T HO D
If the number of decision variables is equal to the number of constraints,
Cramer’s rule is easily applied to a LP problem. Cramer's rule is a method for
solving systems of linear equations using determinants.

 EXAMPLE 16.5
Given the LP problem
2𝑥1 + 𝑥2 + 𝑥3 ≤ 12
Max 𝑍 = 2.5𝑥1 + 𝑥2 + 1.4𝑥3 subject to { 𝑥1 + 𝑥2 + 𝑥3 ≤ 10
𝑥1 − 𝑥2 + 𝑥3 ≤ 4
S O L U T I O N tips
2 1 1 𝑥1 12
Set up the constraints as a matrix: [1 1 1] [𝑥2 ] ≤ [10]
1 −1 1 𝑥3 4
Use Cramer’s rule,
2 1 1 12 1 1
|𝐴| = |1 1 1| = 2 |𝑋1 | = |10 1 1| = 4
1 −1 1 4 −1 1
2 12 1 2 1 12
|𝑋2 | = |1 10 1| = 6 |𝑋3 | = |1 1 10| = 10
1 4 1 1 −1 4
|𝑋1 | 4 |𝑋2 | 6 |𝑋3 | 10
𝑥1 = = =2 𝑥2 = = =3 𝑥3 = = =5
|𝐴| 2 |𝐴| 2 |𝐴| 2
From the objective Function
𝑍 = 2.5𝑥1 + 𝑥2 + 1.4𝑥3 = 2.5(2) + (3) + 1.4(5) = 15
The maximum value is 15 at (2, 3, 5).
Hence, the optimal solution to the given LP problem is: 𝑥1 = 2, 𝑥2 = 3, 𝑥3 = 5
and 𝑍 = 15.

 EXAMPLE 16.6
GX Farms has determined the best mix of fertilizers (A, B and C) to provide its
crops with the desired amounts of active chemicals (nitrogen, phosphorus and
potash) as shown in the following table.
A (kg) B (kg) C (kg) Minimum daily
requirements (units)
Nitrogen 1 4 0 16
Phosphorus 3 8 3 92
Potash 0 2 1 18
Cost ($/kg) 2 10 1
Determine the best mix of fertilizers that minimize cost.

S O L U T I O N tips
Let 𝑥1 = amount of fertilizer A, 𝑥2 = amount of fertilizer B, and 𝑥3 = amount of
fertilizer C.

It is clear from the question that the LP minimization problem is

214 Olaniyi Evans | University Mathematics

𝑥1 + 4𝑥2 ≥ 16
Min 𝐶 = 2𝑥1 + 10𝑥2 + 𝑥3 subject to {3𝑥1 + 8𝑥2 + 3𝑥3 ≥ 92
2𝑥2 + 𝑥3 ≥ 18
1 4 0 𝑥1 16
Set up the constraints as a matrix: [3 8 3] [𝑥2 ] ≥ [92]
0 2 1 𝑥3 18
Use Cramer’s rule,
1 4 0 16 4 0
|𝐴| = |3 8 3| = −10 |𝑋1 | = |92 8 3| = −120
0 2 1 18 2 1
1 16 0 1 4 16
|𝑋2 | = |3 92 3| = −10 |𝑋3 | = |3 8 92| = −160
0 18 1 0 2 18
|𝑋1 | −120 |𝑋2 | −10 |𝑋3 | −160
𝑥1 = = = 12 𝑥2 = = =1 𝑥3 = = = 16
|𝐴| −10 |𝐴| −10 |𝐴| −10
The best mix of fertilizers: Fertilizer A = 12 kg, Fertilizer B = 1 kg, and Fertilizer
C = 16 kg.

From the objective function:

C= 2𝑥1 + 10𝑥2 + 𝑥3 = 2(12) + 10(1) + (16) = 50
The minimum cost at which the farm can fertilize the crops is $50.

 WORKOUT 16.2
1. Given the LP problem.
2𝑥1 + 𝑥2 + 𝑥3 ≤ 60
a) Min 𝐶 = 𝑥1 + 𝑥2 + 𝑥3 subject to { 𝑥1 + 𝑥2 + 𝑥3 ≤ 50
𝑥1 − 𝑥2 + 𝑥3 ≤ 20
0.5𝑥1 + 2𝑥2 ≤ 8
1
b) Max 𝑍 = 𝑥1 + 5𝑥2 + 𝑥3 subject to {1.5𝑥1 + 4𝑥2 + 1.5𝑥3 ≤ 46
2
𝑥2 + 0.5𝑥3 ≤ 9
2. Challenger Fashions produces only two designers: Flash and Blaze. Sewing
is limited to 600 hours per month, and sewing of Flash requires 7 hours
while sewing of Blaze requires 2.5 hours. Sales is $365 per month such that
no more than 1 Flash designer and 2 Blaze designers can be sold each month.
The profit are $10 for each type of designer. How many designers of each
type should be produced each month in order to maximize profit?
3. King Nebuchadnezzar owns two factories which cost $1,000 each per day to
operate. Factory 1 can produce 1 barrel of A-margarine and 8 barrels of B-
margarine each day. Factory 2 can produce 1.4 barrels of A-margarine and 2
barrels of B-margarine each day. The company has orders totaling 24 barrels
of A-margarine and 146 barrels of B-margarine. How many days should he
run each factory to minimize costs?
Chapter 16| Linear Programming 215

4. Manna Electric produces three brands of earpiece: Vax, Qax and Zax. The
table shows the production schedule and costs.
Vax Qax Zax Hours
(hours/unit) (hours/unit) (hours/unit) available
Fabrication 25 100 0 2000
Electronic 75 200 75 11500
Assembly 0 50 25 2250
Cost per unit $100 $500 $50
How many of each brand should be produced in order that the production
cost is minimum?
5. Consider Gorilla Inverters which has three brands in its production line—
G1, G2 and G3. The following table shows the scheduling hours per inverter
in each department and the capacities of the departments, in monthly hours.
G1 G2 G3 Capacity
(hours) (hours) (hours) (hours/month)
Purchasing 40 160 0 6400
Manufacturing 120 320 120 36800
Sales 0 80 40 7200
The management has determined that the costs are $10 for each G1, $50 for
each G2 and $5 for each G3. Find a production plan to minimize cost.
ANSWERS RAPID
1. a) 𝑥1 = 10, 𝑥2 = 15, 𝑥3 = 25; 𝐶 = 50
b) 𝑥1 = 12, 𝑥2 = 1, 𝑥3 = 16; 𝑍 = $25
2. a) Flash = 25, Blaze = 170, Z = $1950
3. a) Factory 1 = 17 days. Factory 2 = 5 days. C = $22,000
4. Vax = 60, Qax = 5 and Zax = 80. C = $12,500
5. G1 = 120. G2 = 10. G3 = 160. C = $2500

 WORKOUT EXTRA

I. FILL IN THE BLANKS

1. LP is an …………. technique used to maximize or minimize a linear function
(usually profit or cost of production), subject to a set of …………..
2. The inequalities are the constraints over which the …………. function is to be
optimized.
3. …………. variables describe the quantities that the decision makers would
like to determine.
II. MULTIPLE CHOICE QUESTIONS
4𝑥1 + 𝑥2 ≥ 2
1. Given: Min 𝐶 = 40𝑥1 + 30𝑥2 subject to { 𝑥1 + 3𝑥2 ≥ 3 , which of the
4𝑥1 + 𝑥2 ≥ 3.2
following is incorrect?
a. 𝑥1 = 0.6 b. 𝑥2 = 0.2 + 𝑥1 c. 𝐶 = 60𝑥2 d. 𝑥1 = 𝑥2
216 Olaniyi Evans | University Mathematics

2. The table shows the least costly mix required to produce workwear for
Equilateral Factory.
Experimental Synthetic Leather Orders

A 0.5 2 0 40
B 1.5 4 1.5 230
C 0 1 0.5 45
Cost ($) 1 3 1
If the optimal solutions are 𝑥1 , 𝑥2 and 𝑥3 , which of the following is correct?
a. 𝑥1 + 4𝑥2 = 𝑥3 b. 𝑥1 = 𝑥2 − 3𝑥3 c. 𝑥2 = 𝑥3 d. 𝑥1 /𝑥3 = 2
3. Consider a manufacturer of android phones with two models in its
production line— Grandeur and Posh. The assembly department assembles
each phone from component parts produced in the mechanical and
electronics departments. The following table shows the production hours
per phone in each department and the capacities of the departments, in
weekly hours.
Grandeur Posh Capacity
(hours) (hours) (hours/week)
Mechanical 3 4 60
Electronics 1 3 30
Assembly 1 1 18
The management has determined that the profit are $30 for each Grandeur
and $40 for each Posh. Determine a production plan to maximize weekly
profit.
a. 12, 6 b. 11, 7 c. 10, 5 d. 100, 8
4. A manufacturer produces butter and margarine. It takes 12 hours of work on
machine A and 6 hours on machine B to produce a package of butter. It takes
3 hours on machine A and 4 hours on machine B to produce a package of
margarine. The company earns a profit of $6 per package on butter and $3
per package on margarine. If he operates machine A and machine B for at
the most 240 and 300 hours respectively per week, how many packages of
each should be produced each week so as to maximise his profit?
a. 3; 75 b. 4; 77 c. 2; 72 d. 1; 76
5. Which theorem is crucial in the graphical method of solving LP problems?
a. Corner Point Theorem
b. Pythagorean Theorem
c. Fundamental Theorem of Calculus
d. Law of Sines and Cosines
ANSWERS RAPID

I II
1. optimization; constraints 1. D 2. A 3. A 4. C 5. A
2. objective
3. decision