Unit 4: “Linear programming” Mathematics applied to Social Science II

Unit 4: LINEAR PROGRAMMING

Inequations
An inequation is an algebraic inequality: x + 3y < 7

The variables that appear in these inequalities are also called unknowns. The degree of an
inequation is the biggest degree of its unknowns.

A solution of an inequation is a value that makes the inequality true. The solution of an
inequation is the set of all the solutions.

x = 7 is a solution of x + 3 > 0, and (-3,∞) is the solution of this inequation.

Two inequations are equivalent if they have the same solution. To obtain an equivalent
inequation we can do only two basic operations:

–Add or subtract the same expression in both sides of the inequation.

x+3>0 x+3–3>0–3 x > -3

–Multiply or divide by the same number (except zero) in both sides of the inequation. If the 1
number is negative we have to change the direction of the inequality.

Mathematics Department IES “Juan de Padilla” – Illescas (Toledo)

Unit 4: “Linear programming” Mathematics applied to Social Science II

-x ≤ 7 x ≥ -7 2x < -8 x < -4

linear inequations with two unknowns

A linear inequation with two unknowns is an algebraic inequality equivalent to one with one
of these forms:
ax  by  c ax  by  c

Examples: ax  by  c ax  by  c a,b, c 

3x + 5y – 7 > 0 3(x + 2) ≤ 5(y - 3) + 12

To solve these inequations:

–We draw the straight line ax + by = c

–The line divides the plane in two parts and we have to check which of the parts verifies the
inequation.

–In the end, we decide if the line is a solution too depending on if the inequation has the
equality or not.

Example:

Exercise: solve the following inequations:

a) y  3x  7

b )8 x  y  5 ( x  1)

Mathematics Department IES “Juan de Padilla” – Illescas (Toledo)

Unit 4: “Linear programming” Mathematics applied to Social Science II

Solutions:

a) b)

Systems of linear inequations with two unknowns

A system of linear inequation with two unknowns is a set of linear inequations. The set of
solutions is formed by the solutions that verify all the inequations. It is also called feasible
region.

Examples:

1)

Mathematics Department IES “Juan de Padilla” – Illescas (Toledo)

Unit 4: “Linear programming” Mathematics applied to Social Science II

x  0
2) 
y  0


 x  2 y  16
x  y  9

 3 x  2 y  2 4

Exercise: solve the following systems:

 y  5x  7
a) 
3x  4 y  5
7 x  y  4
b) 
7 x  7  y

solutions:

a) b)

Linear programming
Linear programming (LP; also called linear optimization) is a method to achieve the best
4
outcome (such as maximum profit or lowest cost) in a mathematical mode whose
requirements are represented by linear relationships.

Mathematics Department IES “Juan de Padilla” – Illescas (Toledo)

Unit 4: “Linear programming” Mathematics applied to Social Science II

More formally, linear programming is a technique for the optimization of a linear objective
function, subject to linear inequality constraints.

There are two types:

– maximize the objective function: z = c1x1 + c2x2 +….+ cnxn

with the constraints:  a 1 1 x 1  a 1 2 x 2  ....  a 1 n x n  b1


a x  a 2 2 x 2  ....  a 2 n x n  b 2
 21 1

 ........................................ .....
 a x  a x  ....  a x  b
 m1 1 m2 2 mn n m

 x 1  0 ; x 2  0 ; ....; x n  0

– minimize the objective function: z = c1x1 + c2x2 +….+ cnxn

with the constraints:  a 1 1 x 1  a 1 2 x 2  ....  a 1 n x n  b1


a x  a 2 2 x 2  ....  a 2 n x n  b 2
 21 1

 ........................................ .....
 a x  a x  ....  a x  b
 m1 1 m2 2 mn n m

 x 1  0 ; x 2  0 ; ....; x n  0

linear programming with two unknowns

Nowadays the programs of linear programming are very complex because there are several
variables. The resolution of these complex programs is done by the "simplex method" with the
help of a computer.

We are going to solve simple problems with only two variables, following these steps:

–Make a table, determine the variables, write constraints and find the objective function.

–Represent the feasible region and find its vertices

–Calculate the value of the function in each vertex and determine the optimum solution

Examples:
1) A small business enterprise makes dresses and trousers. Making a dress requires ½ hour's
cutting work and 20 minutes' stitching. Making a pair of trousers requires 15 minutes' cuttings
and ½ hour's stitching. The profit on a dress is 40 € and on a pair of trousers 50 € respectively.
The business operates for a maximum of 8 hours per day. Determine how many dresses and
trousers should be made to maximize profit and what the maximum profit is.

Let x the number of dresses and y the pairs of trousers.

The objective function (profit) is P(x,y) = 40x + 50y
Constraints are:  1 1
x y  8  2 x  y  32
 5
2 4

1 1
 x y  8  2 x  3 y  48
 3 2
 x  0; y  0


Mathematics Department IES “Juan de Padilla” – Illescas (Toledo)
Unit 4: “Linear programming” Mathematics applied to Social Science II

Feasible region is:

Solving the systems of this pair of equations, we obtain the vertices of the feasible region:
(0,0), (0,16), (16,0) and (12,8). Then:
P(0,0) = 0 P(0,16) = 800 P(16,0) = 640 P(12,8) = 880

12 dresses and 8 pairs of trousers should be made and the maximum profit is 880 €

2) A farmer has 80 hectares of his farm available for planting maize and cabbages. He must
grow at least 10 hectares of maize and 20 of cabbages to meet demands. He prefers to plant
more cabbages than maize but his work force and equipment will only allow him to cultivate a
maximum of three times more maize than cabbages. If the profit of maize is 800 €/ha and on
cabbages 500 €/ha, how should the farmer plant the two crops to make a maximum profit and
what is this profit.

Let x the number of hectares of maize and y the number of hectares of cabbages.
The objective function (profit) is P(x,y) = 800x + 500y
Constraints are:  x  y  8 0

 y  3x
 x  1 0; y  2 0


Feasible region is:

Solving the systems of pair of equations we obtain the vertices of the feasible region: (20,60),
(10,20), (10,30) and (60,20). Then: 6

P(20,60) = 46000 P(10,20) = 18000 P(10,30) = 23000 P(60,20) = 58000

Mathematics Department IES “Juan de Padilla” – Illescas (Toledo)

Unit 4: “Linear programming” Mathematics applied to Social Science II

The farmer should plant 60 hectares of maize and 20 hectares of cabbages and the maximum
profit is 58000 €

3) A school is preparing a trip for 400 students. The company who is providing the
transportation has 10 buses of 50 seats each and 8 buses of 40 seats, but it only has 9 drivers
available. The rental cost for a large bus is 800 € and 600 € for the small bus. Calculate how
many buses of each type should be used for the trip for the least possible cost.

Let x the number of small buses and y the number of big buses.
The objective function (cost) is C(x,y) = 600x + 800y
Constraints are:
40 x  50 y  400

x  y  9
 x  0; y  0


Feasible region is:

P(0,8) = 6400 P(0,9) = 7200 P(5,4) = 6200

5 small buses and 4 big ones should be used for the trip for the least possible cost (6200 €)

You can use the graph method too.

This is very useful with unbounded feasible regions:

Mathematics Department IES “Juan de Padilla” – Illescas (Toledo)

Unit 4: “Linear programming” Mathematics applied to Social Science II

And you can find these situations:

Exercises:

1) A transport company has two types of trucks, Type A and Type B. Type A has a refrigerated
capacity of 20 m3 and a non-refrigerated capacity of 40 m3 while Type B has the same overall
volume with equal sections for refrigerated and non-refrigerated stock. A grocer needs to hire
trucks for the transport of 3,000 m3 of refrigerated stock and 4,000 m3 of non-refrigerated
stock. The cost per kilometer of a Type A is 30 €, and 40 € for Type B. How many trucks of each
type should the grocer rent to achieve the minimum total cost?

2) A store wants to liquidate 200 of its shirts and 100 pairs of pants from last season. They
have decided to put together two offers, A and B. Offer A is a package of one shirt and a pair of
pants which will sell for 30 €. Offer B is a package of three shirts and a pair of pants, which will
sell for 50 €. The store does not want to sell less than 20 packages of Offer A and less than 10
of Offer B. How many packages of each do they have to sell to maximize the money generated
from the promotion?

Solutions: 1) 50 Type A trucks and 67 Type B trucks. 2) 50 packages of each offer

Exam
1.- Solve: 3x + 5y < 2(x+2)

a) b)

c) d) None of them

Mathematics Department IES “Juan de Padilla” – Illescas (Toledo)

Unit 4: “Linear programming” Mathematics applied to Social Science II

2.- Solve: y ≥ 3x + 6

a) b)

c) d) None of them

3 x  y  6
3.- Solve: 
x  4y  8

a) b) 9

Mathematics Department IES “Juan de Padilla” – Illescas (Toledo)

Unit 4: “Linear programming” Mathematics applied to Social Science II

c) d) None of them

2x  y  6
4.- Solve: 
x  y  2

a) b)

c) d) No solution

x  y  3
5.- Solve: 
2x  2 y  7

10
a) b)

Mathematics Department IES “Juan de Padilla” – Illescas (Toledo)

Unit 4: “Linear programming” Mathematics applied to Social Science II

c) d) No solution

6.- A farmer can plant up to 8 acres of land with wheat and barley. He can earn 5000 € for
every acre he plants with wheat and 3000 € for every acre he plants with barley. His use of a
necessary pesticide is limited by federal regulations to 10 gallons for his entire 8 acres. Wheat
requires 2 gallons of pesticide for every acre planted and barley requires just 1 gallon per acre.
What is the maximum profit he can make?

a) 24000 €
b) 25000 €
c) 28000 €
d) 30000 €

7.- A painter has exactly 32 units of yellow dye and 54 units of green dye. He plans to mix as
many gallons as possible of color A and color B. Each gallon of color A requires 4 units of yellow
dye and 1 unit of green dye. Each gallon of color B requires 1 unit of yellow dye and 6 units of
green dye. Find the maximum number of gallons he can mix.

a) 6 galons of color A and 8 galons of color B

b) 0 galons of color A and 9 galons of color B
c) 8 galons of color A and 0 galons of color B
d) 8 galons of color A and 6 galons of color B

8.- A garden shop wishes to prepare a supply of special fertilizer at a minimal cost by mixing
two fertilizers, A and B. The mixture must contain: at least 45 units of phosphate, at least 36
units of nitrate and at least 40 units of ammonium. Fertilizer A costs the shop 0.97 € per
pound. Fertilizer B costs the shop 1.89 € per pound. Fertilizer A contains 5 units of phosphate
and 2 units of nitrate and 2 units of ammonium and fertilizer B contains 3 units of phosphate
and 3 units of nitrate and 5 units of ammonium. How many pounds of each fertilizer should
the shop use in order to minimize their cost?

a) 20 pounds of fertilizer A and 0 pounds of fertilizer B

b) 0 pounds of fertilizer A and 15 pounds of fertilizer B
c) 3 pounds of fertilizer A and 10 pounds of fertilizer B
11
d) 15 pounds of fertilizer A and 2 pounds of fertilizer B

Mathematics Department IES “Juan de Padilla” – Illescas (Toledo)

Unit 4: “Linear programming” Mathematics applied to Social Science II

9.- A calculator company produces a scientific calculator and a graphing calculator. Long-term
projections indicate an expected demand of at least 1000 scientific and 800 graphing
calculators each month. Because of limitations on production capacity, no more than 2000
scientific and 1700 graphing calculators can be made monthly. To satisfy a supplying contract,
a total of at least 2000 calculators must be supplied each month. If each scientific calculator
sold results in 120 € profit and each graphing calculator sold produces a 150 € profit, how
many of each type of calculators should be made monthly to maximize the net profit.

a) The company should manufacture 1200 scientific calculators and 800 graphing
calculators
b) The company should manufacture 1000 scientific calculators and 1000 graphing
calculators
c) The company should manufacture 1000 scientific calculators and 1700 graphing
calculators
d) The company should manufacture 2000 scientific calculators and 1700 graphing
calculators

10.- We need to buy some cabinets for a room. There are two types of cabinets that you have
liked in the market, say X and Y. Each unit of cabinet X costs you 15000 € and requires 6 square
feet of floor space, and holds 8 cubic feet of files. On the other hand each unit of cabinet Y
costs 12000 €, requires 8 square feet of floor space and holds 12 cubic feet of files. You have
been given 140000 € for this purchase, though you may not spend all. The office has room for
no more than 72 square feet of cabinets. How many of each model must you buy in order to
maximize the storage volume?

a) 5 type X cabinets and 5 type Y cabinets

b) 9 type Y cabinets
c) 3 type X cabinets and 6 type Y cabinets
d) 9 type X cabinets

Vocabulary
- Inequation: inecuación

- Unknown: incógnita

- Degree: grado

- Solution: solución

- Linear inequation: inecuación lineal o de primer grado

- Feasible region: región factible

12
- Linear programming: programación lineal

- Constraint: restricción

Mathematics Department IES “Juan de Padilla” – Illescas (Toledo)

Unit 4: “Linear programming” Mathematics applied to Social Science II

- Objective function: función objetivo

- To maximize: maximizar

- To minimize: minimizar

- Simplex method: método del simplex

- Optimum solution: solución óptima

- Profit: beneficio

- Maximum: máximo

- Minimum: mínimo

- Cost: coste

The end

13

Mathematics Department IES “Juan de Padilla” – Illescas (Toledo)