FORMULATION OF PROBLEMS

Problem 01:
A company produces two products P1 and P2, each requiring components C1 and C2.
Availability of components and selling price is shown in the following table:
Product Components Selling Price
C1 C2 (S/. Unit)
P1 1 2 4
P2 3 1 3
Available 15000 10000
It is requested to formulate the problem and optimize sales revenue

Solution 01:

units of the product to be produced (i = 1, 2)

max Z = 4X1+ 3X2

Restrictions:
X1+ 3X2 <= 15,000
2X1+ X2<= 10,000
X1, X2greater than or equal to 0

For the problem, the objective function Z = 4X1+ 3X2indicates that X1 are the units of product 1 whose
The selling price is 4 soles, X2 are the units of product 2 whose selling price is 3 soles. This
The objective function will be optimal if we consider the mentioned constraints, that is, the
the units of product X1 plus the units of product X2 multiplied by 3 must be less than
15,000 units.

This problem seeks to find a mathematical equation that optimizes sales revenue, that is,
it is more profitable to choose a specific number of components for the production of each
product.

Likewise, it does not only consist of finding the mathematical formula but it is based on a series of
restrictions for achieving optimization.

Problem 02:
The production capacities of product P from factories A and B, the costs per unit transported to
the consumption centers C1and C2and their demands are as follows:
Factory Transportation Costs (S/. / Unit) Production
C1 C2 (Unit)
A 5 10 300
B 12 3 400
Demand (Unit) 250 350

It is requested to formulate the problem and minimize the total transportation cost.
Solution 02:

Xij = units transported from factory i (i = 1,2) to consumption center j (j = 1,2)

Objective Function: min Z = 5X11+ 10X12+ 12X21+ 3X22

Restrictions:
Factory A: X11+ X12<= 300
Factory B: X21+ X22<= 400

Consumption Center C1: X11+ X21greater than or equal to 250

C2 Consumption Center: X12+ X22>= 350

We found this problem very interesting to include because it is about minimizing costs.
transport using a mathematical model considering constraints present in production
(factory capacity) and in the demand.

In the objective function, the unit costs for the units transported from each factory are taken to
each consumption center.

Problem 03:
The production capacity of TEXTIL-PERU is 900 units per month. The unit costs of
production and the monthly sales commitment to EXPORT-PERU are as follows:

Month Production Cost Sales (Units)

(S/. / units)
1 100 300
2 150 350
3 200 400
It is requested to formulate the problem:

Solution 03:
Production in month i (i=1,2,3)

Objective Function: min Z = 100X1+ 150X2+200X3

Restrictions:
Month 1: X1less than or equal to 900
X1greater than or equal to 300

Month 2: X2<= 900

X1+ X2greater than or equal to 650

Month 3: X3<= 900

X1+ X2+ X3greater than or equal to 1050

The objective of this problem is to minimize costs based on a series of constraints (capacity
of production and sales commitment).
The objective function is based on the product of the unit costs and units to be produced. In the
restrictions consider the sales commitments for each month.

Problem 04:
FLORANID S.A. is a company dedicated to the marketing of fertilizers for plants that employs 3
different types of ingredients A, B, and C, to obtain 3 types of fertilizers 1, 2, and 3.

Regarding the ingredients, their availability is limited and their costs are as follows:
COSTS
INGREDIENT AVAILABLE QUANTITY (kg)
(pts/kg)
A 4,000 1.300
B 6,000 1.500
C 2.000 1.000
The costs of the subscriptions are:
Fertilizer 1 2.000 pts/kg
Fertilizer 2 3.000 pts/kg
Fertilizer 3 1500 pts/kg.

In addition to the above, the ingredients must be mixed in specific proportions to ensure a
appropriate combination:

For fertilizer 1, no less than 25% of A and no more than 40% of C; for fertilizer 2, no less than 30% of
A, not less than 20% and not more than 30% of B and not more than 15% of C; and for fertilizer 3, not less than 35%
of B.

With all the data that FLORANID S.A. has provided us, they are asking us to determine: How much
How much of each type of fertilizer should be produced to maximize the company's profit?

Thus, with the provided data, we can build a first outline that will allow us to develop
the linear programming model for solving the problem:

FERTILIZERS QUANTITY
COSTS
INGREDIENTS AVAILABLE
1 2 3 (pts/kg)
(kg)
A X11 X12 X13 4000 1300
B X21 X22 X23 6000 1500
C X31 X32 X33 2000 1000

DECISION VARIABLES

Xijamount of ingredient of the type for each type of fertilizer.

RESTRICTIONS

X11+ X12+ X13 4000

X21+ X22+ X23 6000 Availability restrictions
X31+ X32+ X33 2000
 0.75 X11-0.25 X21-0.25 X31 0
0.60 X31-0.40 X11-0.40 X21 0
0.70 X12–0.30 X22-0.30 X32 0
0.80 X22-0.20 X12-0.20 X32 0 Specific blend restrictions
0.70 X22-0.30 X12-0.30 X32 0
0.85 X32-0.15 X22-0.15 X12 0
0.65 X23-0.35 X13-0.35 X33 0

OBJECTIVE FUNCTION
Bº = Income - Expenses

Fertilizer 1:

2000(X11+ X21+ X31)–1300X11-1500X21-1000X31= 700X11+ 500X21+ 1000X31

Fertilizer 2:

3000(X12+ X22+ X32)–1300X12-1500X22-1000X32= 1700X12+ 1500X22+ 2000X32

Fertilizer 3:

1500(X13+ X23+ X33)–1300X13-1500X23-1000X33= 200X13+ 500X33

Max (700X11+ 1700X12+ 200X13+ 500X21+ 1500X22+ 1000X31+ 2000X32+ 500X33)

Thus, once the decision variables, the objective function, and the constraints subject to it are defined,
We have worked on the data to proceed with its resolution. Therefore, the following table shows the
summary of the optimal solution found through the calculations, and on the following page we present the
last table of the SIMPLEX.
OPTIMAL SOLUTION:
X11= 0 S1= 0
X12= 4000 S2= 3328
X13equals 0 S3= 0
X21= 0 S4= 0
X22= 2182 S5= 0
X23= 490 S6= 1818
X31= 0 S7= 727
X321091 S8= 0
X33909 S9= 0
Z = 12700000 S10= 0

This table mainly highlights the presence of 10 slack variables (S), each one of the
which refers to each of the constraints that condition the objective function.

Therefore, since we already know that a basic variable is one whose optimal solution is different
From scratch, we could classify the variables of the solution in the following way:
 Basic variables: X12, X22, X23, X32, X33, S2, S6, S7.

Non-basic variables: X11, X13, X21, X31, S1, S3, S4, S5, S89, S10

Thus, as reflected in the solution of the linear programming model we have

defined, these would be the combinations of ingredients and the amounts of fertilizer produced that we
allows to maximize the benefit:

Fertilizer 1:
We do not use any ingredients to achieve this type of fertilizer, so we are not going to
produce nothing of it.

Payment 2:
To obtain this type of fertilizer, we will use 4000 kg of ingredient A, 2182 kg of
ingredient B and 1091 kg of ingredient C, so we are going to produce and sell 7273 kg of the
type 1 subscription.

Payment 3:
To produce this type of fertilizer, we will use 490 kg of ingredient B and 909 kg of ingredient.
C, without using any of ingredient A, from which we will produce and sell 1399 kg.
of type 3 credit.

Problem 05:

A distilling company has two grades of raw whisky (unblended), I and II, of which
produce two different brands. The regular brand contains 50% of each of grades I and II,
while the super brand consists of two-thirds of grade I and one-third of grade II. The
the company has 3000 gallons of grade I and 2000 gallons of grade II for mixing. Each gallon of the
Regular brand generates a profit of $5, while each gallon of the super brand generates a profit of $6.
How many gallons of each brand should the company produce in order to maximize its profits?

BRANDS GRADE I GRADE II USEFULNESS

REGULAR 50% 50% $5
SUPER 75% 25% $6

Solution:

What are we going to maximize?

x1the amount of regular brand whisky in gallons

x2the amount of super brand whiskey in gallons

Max Z = 5x1+ 6x2…….(1)

Subject to:
1500x1+ 1000 times2<3000 …….. (2)
2250x1+ 500x2<2000 ……….(3) what remains proposed
x1, x20
Problem 06:

A company sells two different nut mixes. The cheaper mix contains 80%.
of peanuts and 20% of nuts, while the more expensive one contains 50% of each type. Each week
the company obtains 1800 kilos of peanuts and 1200 kilos of nuts from its supply sources.
How many kilos of each mix should be produced in order to maximize profits if the earnings are $
10 for each kilo of the cheaper mix and $15 for each kilo of the more expensive mix?

MIXTURE peanut NUT EARNINGS FOR

WEEK
Cheap 80% 20% $10 PER KILO
FACE 50% 50% $15 PER KILO

Solution:

What are we going to maximize?

x1the quantity of the cheap brand mixture in kilograms

x2the amount of the CARA brand mixture in kilograms

Max Z = 10x1+ 15x2…….(1)

Subject to:
1440x1+ 240x2<1800 …….. (2)
900x1+ 600x2<1200 ……….(3) what remains proposed
x1, x20

Problem 07:

(Production decisions) A company produces two products, A and B. Each unit of A requires 2
hours on each machine and 5 hours on a second machine. Each unit of B requires 4 hours on the
first machine and 3 hours on the second machine. There are 100 hours available per week on the first
machine and 110 hours on the second machine. If the company earns a profit of $70 for each
unit of A and $50 for each unit of B. How much should be produced of each unit in order to
maximize total utility?

PRODUCT HRS HRS USEFULNESS

MACHINE 1 MACHINE 2
A 2 5 $70 PER KILO
B 4 3 $50 PER KILO

Solution:

What are we going to maximize?

x1the production quantity of A in units

x2the production quantity of B in units

Max Z = 70x1+ 50x2

Subject to:
2x1+ 4x2<100 ……... (2)
5x1+ 3x2what remains posed
x1, x20

Problem 08:

(Decisions about production) In the previous exercise, suppose that an order for 14 units is received.
from A to the week. If the order must be fulfilled, determine the new value of the maximum profit.

Solution:

What are we going to maximize?

x1the production quantity of A in units

x2the production quantity of B in units

Max Z = 70x1+ 50x2…….(1)

Subject to:
2x1+ 4x2<100 …….. (2)
5x1+ 3x2what remains posed
x1, x20

Problem 09:

(Decisions about Production). A manufacturer produces two products, A and B, each of which
requires time on three machines, as indicated below:

PRODUCT HRS HRS HRS USEFULNESS

MACHINE 1 MACHINE 2 MACHINE 3
A 2 4 3 $250 PER KILO
B 5 1 2 $300 PER KILO

If the number of available hours on the machines per month is 200, 240, and 190 in the case of the first,
second and third, respectively, determine how many units of each product need to be produced at
in order to maximize total utility.

Solution:

What are we going to maximize?

x1the production quantity of A in units

x2the quantity of production of B in units

Max Z = 250x1+ 300x2…….(1)

Subject to:
2x1+ 5x2<200 ……... (2)
4x1+ 1x2<240 ……...(3)
3x1+ 2x2what remains Proposed
x1, x20

Problem 10:

(Decisions about production) In the previous exercise, suppose that a sudden drop in demand
the market for product A forces the company to increase its price. If the profit per unit
From A it increases to $600, determine the new production program that maximizes total utility.

Solution:
PRODUCT HRS HRS HRS UTILITY
MACHINE 1 MACHINE 2 MACHINE 3
A 2 4 3 $600 PER KILO
B 5 1 2 $300 PER KILO
What are we going to maximize?

x1the production quantity of A in units

x2the production quantity of B in units

Max Z = 250x1+ 300x2…….(1)

Subject to:
2x1+ 5x2<200 ……... (2)
4x1+ 1x2<240 ……...(3)
3x1+ 2x2(4) what remains
x1, x20

Problem 11:

(Production decisions) In exercise 5, suppose that the manufacturer is forced by competition.

to reduce the profit margin of product B. How much can the profit of B drop before the
Should the manufacturer change the production schedule? (The production schedule must always be chosen)
in such a way as to maximize total utility).

Solution:
PRODUCT HRS HRS HRS USEFULNESS
MACHINE 1 MACHINE 2 MACHINE 3
A 2 4 3 $600 PER KILO
B 5 1 2 $ X PER KILO
What are we going to maximize?

x1the quantity of production of A in units

x2the production quantity of B in units

but in this case, we must take into account that the PRODUCT's UTILITY should be minimized
B, well, half of the profit is reduced, therefore it remains:
Max Z = 250x1+ 150x2......(1)
The production program should always be chosen in such a way that it maximizes total utility.
Subject to:
2x1+ 5x2<200 ……... (2)
4x1+ 1x2<240 ……...(3)
3x1+ 2x2< 190 ........... (4) what remains Proposed
x1, x20

Problem 12:

(Investment decisions) A Finance manager has $1 106from a pension fund, part of

which should be invested. The manager has two investments in mind, some convertible bonds that
they produce a 6% annual return and some more effective mortgage bonds that yield a 10% annual return. Agreed
with government regulations, no more than 25% of the invested amount can be in bonds
mortgages. Moreover, the minimum that can be invested in mortgage bonds is $100,000. Determine
the amounts of the two investments that will maximize the total investment.

Solution:

What are we going to maximize?

x1the amount of investment in conservative bonds

x2the amount of investment in mortgage bonds

Max Z = x1+ x2…….(1)

Subject to:
(0.06)(1,000,000)x1(0.1)(1,000,000)x2(1,000,000)(0.25) ……... (2)
x2>100,000 ……... (3)
x1, x20

Problem 13:

(Decisions about crop planting) A farmer has 100 acre-feet in which he can plant
two crops. He has $3000 to cover the planting cost. The farmer can rely on a
a total of 1350 man-hours allocated for the harvesting of the two crops and the table shows the
following data per acre:
Crops COST OF PLANTING DEMAND HOURS - USEFULNESS
MAN
FIRST $20 5 $100
SECOND $40 20 $ 300

Solution:

What are we going to maximize?

x1the production amount of the FIRST CROP in acre-feet

x2the production quantity of the SECOND CROP in acre-feet
100x1+ 300x2…….(1)
The production program should always be chosen to maximize total utility.
Subject to:
x1+ x2< 100 ......... (2) this equation is due to the fact that it only has 100 acre-feet for the crops
5x1+ 20x2<1350…... (3)
20x1+ 40x2less than 3000 ......(4) what remains posed
x1, x20

Problem 14:

(Decisions about crop planting) In the previous exercise, determine the portion of the land that
It should be considered for each crop whether the utility from the second crop rises to $450 per acre.

Solution:
Crops COST OF PLANTING DEMAND HOURS- USEFULNESS
MAN
FIRST $20 5 $ 100
SECOND $40 20 $ 450

What are we going to maximize?

x1the production quantity of the FIRST CROP in acre-feet

x2the production amount of the SECOND CROP in acre-feet

Max Z = 100x1+ 450x2…….(1)

The production program must always be chosen in such a way as to maximize total utility.
Subject to:
5x1+ 20x2<1350…... (2)
20x1+ 40x2< 3000 ......(3) what remains Proposed
x1, x20

Problem 15:

(Diet planning) The dietitian of a hospital must find the cheapest combination of two
products, A and B, that contain:
- at least 0.5 milligrams of thiamine
- at least 600 calories

PRODUCT THIAMINE CALORIES

A 0.2 mg 100
B 0.08 mg 150
Solution:

Variables:
x1the cheapest amount of product A
x2the Cheapest Amount of Product B
Max Z = x1+ x2…….(1)
Subject to:
0.2x1+ 0.08x2>0.5... (2) (at least)
100x1+ 150x2150 ......(3) what remains stated
x1, x20

Problem 16:

(Purification of the mineral) A company owns two mines, P and Q. The following table shows the
production of elements per ton produced by both mines respectively:

MINES COPPER ZINC MOLYBDENUM COST PER TON OF OBTAINING

MINERAL
P 50 lb 4 lb 1 lb $ 50
Q 15 lb 8 lb 3 lb $60

The company must produce at least the following quantities of metals each week.
shown below:
- 87,500 pounds of copper
- 16,000 pounds of zinc
- 5,000 pounds of molybdenum

How much mineral should be obtained from each mine in order to meet the requirements of
production at a minimum cost?

Solution:

Variables:
x1the Quantity of Mineral from MINE P in pounds
x2the Amount of Mineral from MINE Q in pounds

Max Z = 50x1+ 60x2…….(1)

50x1+ 15x2< 87,500 ......... (2) (COPPER)
4x1+ 8x2<16,000…... (3) (ZINC)
x1+ 3x2< 5000 ......(4) (MOLYBDENUM)
x1, x2what remains stated

Problem 17:

The storage room of an industrial chemistry apartment stores at least 300

glasses of one size and 400 of a second size. It has been decided that the total number of glasses
The stored quantity should not exceed 1200. Determine the possible quantities of these two types of glasses.
that can be stored and shown with a graph.

Solution:

Variables:
x1the number of first size glasses
x2the number of second size glasses

Max Z = x1+ x2…….(1)

Subject to:
x1>300... (2) (at least)
x2> 400 ......(3)
x1+ x2< 1200 .......(4)
x1, x2> 0

Problem 18:

(Storage Space) In the previous exercise, let's assume that the cups of the first size
they take 9 in2from the shelf and those of the second 6 in2The total area of available shelves for storage is
at most 62.8 ft2Determine the possible quantities of the glasses and display it with a graph.

Solution:

Variables:
x1the quantity of first size glasses
x2the number of size two glasses

Max Z = x1+ x2
Subject to:
x1>300... (2) (at least)
x2> 400 ......(3)
x1+ x2< 1200 .......(4)
9x1+ 6x2< 62.8 .......(5)
x1, x20

Problem 19:

A person is thinking of replacing meat in their diet with beans.

Soy. An ounce of meat contains an average of almost 7 grams of protein while an ounce
Soybeans (green) contain almost 3 grams of protein. If you require that your protein intake
the daily intake obtained from meat and combined soybean beans should be at least 50 grams.
What combination of these nutrients will form an acceptable diet?

Solution:

Variables:
x1the Amount of Meat
x2the Amount of Soybeans

Min Z = x1+ x2…….(1)

Subject to:
7x1+ 3x2> 50 .......(5)
x1, x20
Problem 20:

(Ecology) A fish pond supplies them each spring with two species of fish S and T. There are two
types of food F1y F2available in the pond. The average weight of the fish and the requirement
The average daily food for each fish of each species is given in the table below:

Species F1 F2 Average Weight

S 2 Units 3 Units 3 pounds
T 3 Units 1 Units 2 pounds

If there are six hundred of F1and three hundred of F2everyday. How do you debit supply the pool for
What is the total weight of fishes that are at least 400 pounds?

Solution:

What are we going to maximize?

x1the Quantity of Fish Supply (SPECIES S) in Spring in Units

x2the Supply Quantity of Fish (SPECIES T) in Spring in Units

Max Z = x1+ x2…….(1)

Subject to:
2x1+ 3x2<600 …….. (2)
3x1+ 1x2<300 ……….(3)
3x1+ 2x2400 what remains Stated
x1, x20

Problem 21:

A farmer has 200 pigs that consume 90 pounds of special food every day. The food is
prepare a mixture of corn and soybean flour with the following compositions:
Pounds per Pound of Food
Food Football Protein Fiber Cost ($/lb)
Corn 0.001 0.09 0.02 0.2
Soy Flour 0.002 0.6 0.06 0.6

The dietary requirements of pigs are:

1. At least 1% calcium
2. At least 30% protein
3. Maximum 5% fiber

Determine the food mix with the lowest cost per day

Solution:

What are we going to minimize?

x1the Amount of Corn Pound for pound of Food
x2the Amount of Soy Flour per pound of Feed
Min Z = 0.2x1+ 0.6x2…….(1)
Subject to:
0.001x1+ 0.002x2(90)(0.01) …….. (2)
0.09x1+ 0.6x2<(90)(0.3) ……….(3)
0.02x1+ 0.06x2(90)(0.05) .......... (4) what remains Proposed
x1, x20

Problem 22:

A small bank allocates a maximum of $20,000 for personal and automobile loans during
the next month. The bank charges an annual interest rate of 14% on personal loans and 12% on
car loans. Both types of loans are settled over periods of three years. The amount of
Auto loans should be at least twice the amount of loans
Personal. Past experience has shown that uncovered debts constitute 1% of
How should personal loans be allocated?

Solution:

What are we going to maximize?

x1the Amount of Personal Loan Funds
x2the amount of car loan funds

Min Z = 0.2x1+ 0.6x2

Subject to:
(0.14)(20,000)x1(0.12)(20,000)x2<20000 …….. (2)
x2(2)(0.14)(20,000) ……….(3)
x1(0.01)(0.12)(20,000) .......... (4) what remains stated
x1, x20

Problem 23:

A radio assembly plant produces two models HiFi-1 and HiFi-2 on the same assembly line. The
The assembly line consists of three stations. The assembly times at the work stations are:

Minutes per Unit of Minutes per Unit of

Workstation HiFi-1 HiFi-2
1 6 4
2 5 5
3 4 6

Each workstation has a maximum availability of 480 minutes per day. However, the
workstations require daily maintenance, which contributes 10%, 14%, and 12% of the 480
total minutes available daily for stations 1, 2, and 3 respectively.
the company wishes to determine the daily units that will be assembled of HiFi-1 and HiFi-2 in order to minimize
the sum of unused (inactive) times in the three stations.
Solution:

What are we going to minimize?

x1the Daily Units Quantity of HiFi - 1

x2the Amount of Daily HiFi Units - 2

Min Z = x1+ x2…….(1)

Subject to:
6x1+ 4x2<(0.1)(480) …….. (2)
5x1+ 5x2(0.14)(480) ……….(3)
4x1+ 6x2(0.12)(480) .......... (4) what remains is posed
x1, x20

Problem 24:

An electronics company produces two radio models, each on a production line.

production of different volume. The daily capacity of the first line is 60 units and the second
It has 75 radios. Each unit of the first model uses 10 pieces of certain electronic components.
as each unit of the second model requires eight pieces of the same component. The
The maximum daily availability of the special component is 800 pieces. The profit per unit of
Models 1 and 2 are $30 and $20, respectively. Determine the optimal daily production of each model.
radio.

Solution:

What are we going to maximize?

x1the production quantity of model 1 of Radio

x2the production quantity of model 2 of Radio

Max Z = 30x1+ 20x2…….(1)

Subject to:
x1<60 …….. (2)
10x1+ 8x2<800 ……….(3)
x2< 75 .......... (4) what remains proposed
x1, x2zero

Problem 25:

Two products are manufactured by passing successively through three machines. The time allocated per machine
The production time and profit per unit are limited to 10 hours per day.
each product is:
Minutes Per Unit
Product Machine 1 Machine 2 Machine 3 Profit
1 10 6 8 $2
2 5 20 15 $3
Note: Determine the optimal combination of the products.
Solution:

What are we going to minimize?

x1the Quantity of Units of Product 1

x2the Quantity of Units of Product 2

Min Z = 2x1+ 3x2…….(1)

Subject to:
10x1+ 5x2<10 …….. (2)
6x1+ 20x2<10 ……….(3)
8x1+ 15x2(4) what remains posed
x1, x20

Problem 26:

A company can advertise its product using local radio and television stations.
Your budget limits advertising expenses to $1000 per month for each minute of advertisement on the radio.
It costs $5 and each minute of advertising on television costs $100. The company would like to use radio.
at least two times more than television. Past experience shows that every minute of
Television advertising will generate generally 25 more sales than each minute of advertising.
by radio. Determine the optimal allocation of the monthly budget for radio advertisements and
television.

Solution:

What are we going to maximize?

x1the monthly budget amount for the Radio

x2the monthly budget amount for the Television

Max Z = x1+ x2…….(1)

Subject to:
5x1+ 100x2<1000 …….. (2)
x2(2)(x1)
x1(25)(x2………(3)
x1, x20

Problem 27:

A company produces two products: A and B. The sales volume of product A is at least the
60% of the total sales of the two products. Both products use the same raw material, which...
Daily availability is limited to 100 lb. Products A and B use this raw material at the rates.
or rates of 2 lb/unit and 4 lb/unit, respectively. The selling price of the products is $20 and $40
per unit. Determine the optimal allocation of raw material to the two products.

Solution:
What are we going to maximize?

x1the Quantity of Units of Product A

x2the Quantity of Units of Product B

Max Z = 20x1+ 40x2…….(1)

Subject to:
2x1+ 4x2<100 …….. (2)
x1(0.6)(60) ……….(3)
x1, x20

Problem 28:

A company makes two types of hats. Each hat of the first type requires twice as much
work time for a product of the second type. If all the leftovers are exclusively
of the second type. The company can produce a total of 500 units per day. The market limits the
daily sales of the first and second types at 150 and 200 units. Assuming that the profit that is
The cost per product is $8 for type 1 and $5 for type 2. Determine the number of leftovers of each.
type that must be developed to maximize profit.

Solution:

What are we going to maximize?

x1the Quantity of Units of Hat TYPE 1

x2the Quantity of Units of Hat TYPE 2

Max Z = 8x1+ 5x2…….(1)

Subject to:
150 times1+ 200x2<500 …….. (2)
x1(2)(200) ……….(3)
x120

Problem 29:

A small company has two machines to produce two products. Each product has to
pass through machine A and then through machine B. Product 1 requires 3 hours of machine A and 2
from machine B, while product 2 requires 1 hour from machine A and 2 hours from machine B.
The capacity of machines A and B are 500 and 650 weekly hours respectively. Product A leaves
350 pesos and the second product B leaves 600 pesos in profits. Analyze the situation.
operation of this, given that due to a shortage of raw materials it cannot produce more than 21 units of the
product.

Solution:

What are we going to maximize?

x1the Quantity of Units of Product A
x2the Quantity of Units of Product B

Max Z = 350x1+ 600x2......(1)

Subject to:
3x1+ 1x2<500 …….. (2)
2x1+ 2x2<650 …….. (3)
x1+ x2<21 ……...….(4)
x1, x20

Problem 30:

The group 'IMPEXA' wants to advertise its products in three different media: radio, television
and magazine. The main objective is to reach as many customers as possible. They have conducted a study and the
result is:

During the day During the night Radio Magazines

Number of clients 450,000 800,000 675,000 200,000
potentials what can
reach by units of
advertising
500,000 1,000,000 650,000 250,000

"IMPEXA" does not want to spend more than $1,200.00. Additionally, they do not wish to spend more on television advertising.
of 750 thousand pesos. Three television units are desired to be purchased during the day and 2 units during the night.
night. Formulate the problem as a linear programming model.

Solution:

What are we going to MAXIMIZE?

x1the number of potential clients per day

x2the number of potential customers per night
x3the number of customers by radius
x4the number of customers by magazines

Max Z = x1+ x2+ x3+ x4…….(1)

Subject to: (BALANCE RESTRICTIONS)
x1+ x2+ x3+ x4< 1,200,000
x1+ x2< 750,000
x1450,000
x1< 500,000
x2800,000
x2< 1,000,000
x3375,000
x3< 650,000
x4200,000
x4< 250,000
3x1< 2x2

Problem 31:

Mrs. Morales has a diet to follow, which meets the following nutritional requirements.
At least 4 mg. of vitamin A
At least 6 mg of vitamin B
At most 3 mg of vitamin D.

Likewise, the diet consists of bread, cheese, beef, and meat. The following table gives us the
requirements per vitamin in mg, as well as the cost:
Content in mg per gram of product

PRODUCT COST VITAMIN A VITAMIN B VITAMIN D

PAN 40 0.20 0.18 0.10
CHEESE 31 0.15 0.10 0.14
GOOD 19 0.15 0.40 0.15
MEAT 53 0.30 0.35 0.16

Solution:

What are we going to minimize?

x1the quantity to buy of bread

x2the quantity to buy of cheese
x3the quantity to buy of EGG
x4the quantity to buy of MEAT

Min W = 40x1+ 31x2+ 19x3+ 53x4…….(1)

Subject to:
0.20x1+ 0.15x2+ 0.15x3+ 0.30x44
0.18x1+ 0.10x2+ 0.40x3+ 0.35x46
0.10x1+ 0.14x2+ 0.15x3+ 0.16x43
x1, x2, x3, x40

Problem 32:

(Investments) Julio, who is an investment advisor, is presented with 4 projects along with their respective costs.
over a period of three years, as well as the total utility. He needs to maximize the total utility available.
of $50,000; $24,000; and $30,000 in each of the following years:
PROJECT TOTAL UTILITY COST COST COST
YEAR 1 YEAR 2 YEAR 3
X1 100 6 14 5
X2 90 2 8 14
X3 75 9 19 18
X4 80 5 2 9

Solution:
What are we going to minimize?

x1the Amount of Corn Pound for Pound of Food

x2the Amount of Soy Flour per pound of Food

Min Z = 0.2x1+ 0.6x2…….(1)

Subject to:
0.001x1+ 0.002x2(90)(0.01) …….. (2)
0.09x1+ 0.6x2(90)(0.3) ……….(3)
0.02x1+ 0.06x2(90)(0.05) .......... (4) what remains proposed
x1, x20

Availability:
The available amounts per year are assigned to the different variables or projects under these
restrictions to optimize or maximize total utility.

Problem 33:
Suppose that the Agricultural Credit Bank has two investment plans, namely: The first in the
irrigation land program, the second in the rainfed land program. The first program
returns 30% of the investment at the end of the year, while the second plan returns 65% of the
investment, for the term of two years. The interest received in both plans is reinvested from
new in either of the two plans. Formulate the linear program that allows the bank to maximize the
total investment in a six-year period, if the investment is $100 million.

Solution:

What are we going to MAXIMIZE?

xiRthe amount of risky investment for one year i

xitthe amount of temporary investment in 2 years i
where i = 1, 2, 3, 4, 5, 6.

Max Z = x1+ x2+ x3+ x4…….(1)

Subject to: (BALANCE RESTRICTIONS)
x1R+ x1T< 100,000
x2R+ x2T< 1.30x1R
x3R+ x3T< 1.30x2R+ 1.65x1T
x4R+ x4T< 1.30x3R+ 1.65x2T
x5R+ x5T< 1.30x4R+ 1.65x3T
x6R< 1.30x5R+ 1.65x4T
x1T, xR0

Problem 34:

A perfume company can advertise its product by using radio stations and
television. Its budget limits advertising expenses to $1,500 per month. Each minute of advertisement in
the radio costs $15 and each minute of television advertising costs $90. The company would like to use the
radio at least twice as much as television. Historical data shows that every minute of
Television advertising will generally generate 30 times more sales than each minute of
radio advertising. Determine the optimal allocation of the monthly budget for radio ads and
television.

Solution:

What are we going to maximize?

x1the monthly budget amount for the Radio

x2the monthly budget amount for the Television

Max Z = x1+ x2
Subject to:
15x1+ 90x2<1500 …….. (2)
x2(2)(x1)
x1(30)(x2) ……….(3)
x1, x20

Problem 35:
An animal store has determined that each hamster should receive at least 70 units of
protein. 100 units of carbohydrates and 20 units of fat. If the store sells the six types of
foods shown in the table. What mixture of food meets the needs at minimum cost?
for the store?

Food Proteins Carbohydrates Fat Cost

Units / Ounce (Units / Ounce) (Units / Ounce) (Onza)
A 20 50 4 2
B 30 30 9 3
C 40 20 11 5
D 40 25 10 6
E 45 50 9 8
F 30 20 10 8

Solution:

What are we going to minimize?

x1the amount to mix of A

x2the amount to mix of B
x3the amount to mix of C
x4the amount to mix of D
x5the amount to be mixed of E
x6the amount to mix of F

Min W = 2x1+ 3x2+ 5x3+ 6x4+ 8x5+ 8x6…….(1)

Subject to:
20x1+ 30x2+ 40x3+ 40x4+ 45x5+ 30x6< 70 ......... PROTEIN
50x1+ 30x2+ 20x3+ 25x4+ 50x5+ 20x6< 100 ------ CARBOHYDRATES
4x1+ 9x2+ 11x3+ 10x4+ 9x5+ 10x6< 20 ---------- FAT
x1, x2, x3, x40

Problem 35:
A local manufacturing company produces four different metal products that must
machining, polishing, and assembling. The specific time requirements (in hours) for each product
are the following:

Machining Polished Assembly

Product I 3 1 2
Product II 2 1 1
Product III 2 2 2
Product IV 4 3 1

The company has 480 hours available weekly for machining, 400 hours for polishing, and 400 hours.
for the assembly. The unit profits per product are $6, $4, $6, and $8 respectively.
the company has a contract with a distributor in which it commits to deliver 50 weekly
units of product 1 and 100 units of any combination of products II and III, as applicable
production, but only a maximum of 25 units of product IV. How many units of each product?
the company should manufacture weekly in order to meet all the conditions of the contract and
maximize total profit?
Consider incomplete pieces as a model of Linear Programming.

Solution:

What are we going to minimize?

x1the quantity to be manufactured of product I

x2the quantity to be produced of product II
x3the quantity to be produced of product III
x4The quantity to be manufactured of product IV

Min W = 6x1+ 4x2+ 6x3+ 8x4…….(1)

Subject to:
3x1+ 2x2+ 2x3+ 4x4< 480
1x1+ 1x2+ 2x3+ 3x4< 400
2x1+ 1x2+ 2x3+ 1x4< 400
x1> 50
x2+ x3 100
x4< 25
x1, x2, x3, x40

Problem 36:
Four products are processed successively on two machines. The manufacturing times in hours per
The unit of each product is tabulated below for the two machines:

Machine Product 1 Product 2 Product 3 Product 4

1 2 3 4 2
2 3 2 1 2

The total cost of producing one unit of each product is directly based on the time of
machine. Suppose that the cost per hour for machines 1 and 2 is $10 and $15. The total hours
budgeted for all products in machines 1 and 2 are 500 and 380. if the selling price per
unit for products 1, 2, 3, and 4 at $65, $70, $55, and $45, formulate the problem as a model of
linear programming to maximize total net profit.

Solution:

What are we going to maximize?

x1the quantity to be manufactured of product 1

x2the quantity to be produced of product 2
x3the quantity to be produced of product 3
x4the quantity to manufacture of product 4

Max W = 65x1+ 70x2+ 55x3+ 45x4…….(1)

Subject to:
2x1+ 3x2+ 4x3+ 2x4< 500
3x1+ 2x2+ 1x3+ 2x4< 380
x1, x2, x3, x4> 0

Problem 37:

Delta Company has specialized machinery in the plastic industry. The company is preparing to
to start operations next January and has $300,000 and ten machines. The operation of
each machine requires $4,000.00 at the beginning of a month to produce and at the end of the month the amount of
$9,000.00 however, for every two machines an operator is needed whose monthly salary is
$3000.00 paying at the beginning of the month. The company aims to plan its production, employment of
operator and purchase of machinery that must have, at the beginning of the seventh month, the maximum number of
machine in operation.

At the beginning of each month, the company has three options available to acquire machinery.
The first option is to buy a machine for $20,000.00 each with a delivery period of one
This means that if at the beginning of each month 't' the machinery is requested and paid for, it will be delivered at the beginning.
of month t + 1.

In the second alternative, each machine can be purchased for $15,000.00, but the delivery period
It is in two months. The last alternative is to buy each machine for $10,000.00 with a delivery period
in three months.
Formulate a linear programming model that allows determining the machinery purchase policy.
production and payment of operators each month, such that at the beginning of month seven there is
maximum number of machines in operation.

Solution:

What are we going to minimize?

x1the quantity to be produced of product I

x2the quantity to be manufactured of product II
x3the quantity to be produced of product III
x4the quantity to be produced of product IV

Min W = 6x1+ 4x2+ 6x3+ 8x4…….(1)

Subject to:
3x1+ 2x2+ 2x3+ 4x4< 480
1x1+ 1x2+ 2x3+ 3x4< 400
2x1+ 1x2+ 2x3+ 1x4< 400
x1> 50
x2+ x3100
x4< 25
x1, x2, x3, x40

Problem 38:

A chemical company that operates 24 hours a day has the following needs
technical and specialized personnel

Period Time of the day Technical staff Specialized Personnel

1 6–10 20 8
2 10–14 40 12
3 14–18 80 15
4 18–22 45 9
5 22–02 25 3
6 02 - 06 10 2

Note that period 1 follows period 6. Consider that each person in the company works 8 hours.
consecutive. Assume that Xty Ztrepresent the number of technical and specialized personnel,
respectively, that start working at the beginning of period t each day. In this company, the
the union agreement establishes that there must always be at least three times the number of
technical personnel that of specialized personnel. Establish a linear programming model for
determine the minimum number of technical and specialized personnel to meet daily needs
working at the company.

Solution:

xiRthe amount of technical personnel

xitthe Quantity of specialized personality
where i = 1, 2, 3, 4, 5, 6.

Min Z = x1+ x2
Subject to:
20x1+ 8x2> 60
40x1+ 12x2> 120
80x1+ 15x2240
45x1+ 9x23(45)
25x1+ 3x2> 75
10x1+ 2x230

Problem 39:

National Railways of Mexico has the following demand for locomotives at the beginning of next year
diesel to use its system nationwide:

Quarter 1 2 3
Locomotives 750 800 780
Diesel

The railroad management can meet its demand by combining the following
alternatives:

a) Use of the existence of diesel locomotives in working condition

b) Purchase of locomotives from abroad which can be delivered at the beginning of any

of 6 months.
d) Report locomotives to the national workshops urgently. The repair time is
of 3 months.

Alternative b has a cost of $5,000,000 per locomotive

Alternative c has a cost of $100,000 per locomotive.
Alternative d has a cost of $250,000 per locomotive.

It is estimated that at the beginning of the year there will be 650 locomotives in working condition and the budget of
The operation for that year is $100,000,000 delivered in quarterly installments of 40, 30, 20, and 10.
millions respectively.

At the end of each quarter, 5% of the locomotives are supposed to be kept for repair and 5%
they are out of service. Formulate a linear programming problem that allows determining the
combination of policies that the management of F.F.C.C. must take into account to minimize costs and
meet the demand for locomotives.

Solution:

What are we going to minimize?

x1the Demand Quantity in quarter 1
x2the Quantity of Demand in quarter 2
x3the Quantity of Demand in quarter 3

Min W = 5,000,000x1+ 100,000x2+ 250,000x3…….(1)

Subject to:
x1+ x2+ x3< 100,000,000
750x1+ 800x2+ 780x3650
x1(0.05)(750)
x2> (0.05)(800)
x3> (0.05)(780)
x1, x2, x3, x40

Problem 40:

A company produces brown sugar, white sugar, powdered sugar, and molasses from syrup.
sugar cane. The company buys 4000 tons of syrup per week and has a contract for
deliver a minimum of 25 tons weekly of each type of sugar. The production process is
start by producing brown sugar and molasses with the syrup. One ton of syrup produces 0.3 tons
of brown sugar and 0.1 tons of molasses. Then white sugar is produced by processing sugar
brown sugar. 1 ton of brown sugar is required to produce 0.8 tons of white sugar.
Finally, powdered sugar is made from white sugar through a grinding process.
special, which has a 95% conversion efficiency (1 ton of white sugar produces 0.95 tons
of powdered sugar). The profits per ton of brown sugar, white sugar, powdered sugar
and the syrups are priced at $150, $200, $230, and $35, respectively. Formulate the problem as a program.
linear.

Solution:
The production of each type of sugar according to the production process is detailed below by
each ton of material used.

Production per ton.

the brunette molasses az.white az.pulverizada
Syrup (1 ton) 0.3 0.1
Az. Morena (1tn) 0.8
White (1tn) 0.95

We determine the decision variables:

Xi = product obtained (tons per week), where i: 1, 2, 3, 4; represents the
diferentes tipos de productos. 1: azúcar morena, 2: melaza, 3: azúcar blanca, 4: azúcar
powdered.
The restrictions:
X1 / 0.3 + X2 / 0.1 <= 4000 (Restriction for syrup TN.)
X1 >=25000 (Restriction for tn. of brown sugar)
X3 / 0.8 >= 25000 (Restriction for tn. of white sugar)
X4 / 0.95 >= 25000 (Restriction for powdered sugar tn.)
X1, X2, X3, X4 >=0 Non-negativity constraint
The objective function to maximize profits:
 max. z = 150X1 + 200X3 + 230X4 + 35X2

The structure of the model is as follows:

Xi = product obtained (tons per week) i: 1, 2, 3, 4
F.O Max z = 150X1 + 200X3 + 230X4 + 35X2
S.a:
X1 / 0.3 + X2 / 0.1 <= 4000 (Restriction for syrup tn.)
X1 >=25000 (Restriction for brown sugar tn.)
X3 / 0.8 >= 25000 (Restriction for tn. of white sugar)
X4 / 0.95 >= 25000 (Restriction for powdered sugar tn.)
X1, X2, X3, X4 >=0 (Non-negativity restriction)

Problem 41:

Four products are processed in sequence by two machines. The following table provides the data.
pertinent to the problem.

Manufacturing time per unit (hour)

Machine Cost Prod. 1 Prod. 2 Prod. 3 Prod. 4 Capacity
($) / hour (hour)
1 10 2 3 4 2 500
2 5 3 2 1 2 380
Selling price 65 70 55 45
Per unit ($)

Formulate the model as a linear programming model.

Solution:
We determined the decision variables:
Xij: units produced by product type j: 1, 2, 3, 4.
using each machine i: 1, 2.

The restrictions:
2X11 + 3X12 + 4X13 + 2X14 <= 500 (Capacity constraint of machine 1)
3X21 + 2X22 + 1X23 + 2X24 <= 380 (Capacity constraint of machine 2)

The objective function to maximize profits:

Max z = 65(X11 + X12) + 70(X12 + X22) + 55(X13 + X23) + 45(X14 + X24) -
10 (2X11 + 3X12 + 4X15 + 2X14) - 5(3X21 + 2X22 + 1X23 + 2X24)
Simplifying:
max z = 45X11 + 50X21 + 40X12 + 60X22 + 15X13 + 50X23 + 25X14 + 35X24

The structure of the model is as follows:

Xij: units produced by product type j: 1, 2, 3, 4.

Using each machine i: 1, 2.
O 45X11 + 50X21 + 40X12 + 60X22 + 15X13 + 50X23 + 25X14 + 35X24
 S.a:
2X11 + 3X12 + 4X13 + 2X14 <= 500 (Capacity restriction of machine 1)
3X21 + 2X22 + 1X23 + 2X24 <= 380 Capacity restriction of machine 2
X11, X12, X13, X14, X21, X22, X23, X24 >= 0 Non-negativity constraint

Problem 42:

With rubies and sapphires, a businessman produces two types of rings. A type 1 ring requires 2 rubies, 3
sapphires and 1 hour of a jeweler's work. A type 2 ring requires 3 rubies, 2 sapphires, and 2 hours of work.
from a jeweler. Each type 1 ring is sold for 400 dollars, and each type 2 ring for 500 dollars. They can be
sell all the rings produced. Currently, there are 100 rubies, 120 sapphires, and 70 hours of
work of a jeweler. More rubies can be purchased at a cost of 100 dollars per ruby. The demand of the
the market requires a production of at least 20 type 1 rings and at least 25 rings of the
Type 2. Formulate the problem to maximize profit.

Solution:
Requirement per unit
Type of
ring Availability
Type 1 Type 2
Rubies (unit) 2 3
Sapphires (unit) 3 2
Man-hours 1 2 70
Price ($/unit) 400 500
Demand (unit) 20 25

We determine the decision variables:

number of rings of type i = 1, 2
The restrictions:
2X1 + 3X2 - X3 <= 100 (Restriction for the amount of rubies)
3X1 + 2X2 <= 120 (Constraint for the quantity of sapphires)
X1 + 2X2 <= 70 Restriction on working hours for a jeweler
X1 >= 20 (Constraint for type 1 demand)
X2 >= 25 (Constraint for type 2 demand)

The objective function to maximize profits:

Max z = 400X1 + 500X2 - 100X3

The structure of the model is as follows:

number of rings of type i = 1, 2

Max z = 400X1 + 500X2 - 100X3
S.a:
2X1 + 3X2 - X3 <= 100 (Constraint for the quantity of rubies)
3X1 + 2X2 <= 120 (Constraint for the quantity of sapphires)
X1 + 2X2 <= 70 (Jeweler's working hours constraint)
X1 >= 20 (Constraint for the demand of type 1)
X2 >= 25 (Constraint for type 2 demand)
 X1, X2, X3 >= 0 (Non-negativity constraint)

Problem 43:
For a 24-hour shift, a hospital is requiring the following staff for the area of
nursing, 6 shifts of 4 hours each are defined.

Number
Shift minimum
of personal
2:00 - 6:00 4
6:00 - 10:00 8
10:00 AM - 2:00 PM 10
14:00 - 18:00 7
6:00 PM - 8:00 PM 12
8:00 PM - 12:00 AM 4

Employment contracts are for 8 consecutive hours per day. The goal is to find the smallest number of
people who meet the requirements. Formulate the problem as a programming model
linear.

Solution:
We determine the decision variables:
Amount of staff per shift i = 1, 2, 3, 4, 5, 6.

Staff needs by schedule

Hours 2:00 - 6:00 6:00 - 10:00 10:00 - 14:00 14:00 - 18:00 18:00 - 20:00 20:00 - 24:00
X1 X1
X2 X2
X3 X3
X4 X4
X5 X5
X6 X6
Personal 4 8 10 7 12 4

The shift personnel restrictions are:

X1 + X6 >= 4
X1 + X2 >= 8
X2 + X3 >= 10
X3 + X4 >= 7
X4 + X5 >= 12
X5 + X6 >= 4

The objective function to minimize the amount of staff

Min z = X1 + X2 + X3 + X4 + X4 + X5 + X6

The structure of the model is as follows:

Xi = Amount of personnel per shift i = 1, 2, 3, 4, 5, 6.
F :O Min z = X1 + X2 + X3 + X4 + X4 + X5 + X6
S.a:
X1 + X6 >= 4
X1 + X2 >= 8
X2 + X3 >= 10
X3 + X4 >= 7
X4 + X5 >= 12
X5 + X6 >= 4
X1, X2, X3, X4, X5, X6 >= 0 (Non-negativity constraint)