Problem 35:

A pet store has determined that each hamster should receive less than 70.
units of protein. 100 units of carbohydrates and 20 units of fat. If the
store sells the six types of food shown in the table. What mix of
Does the food meet the needs at a minimal 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 mix 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
x12, x3, x40

Problem 35:
A local manufacturing company produces four different metallic products that
they must be machined, polished, and assembled. The specific time requirements (in
hours) for each product are as follows:

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 the
polished and 400 hours for assembly. The unit profits per product are $6, $4
$6 and $8 respectively. The company has a contract with a distributor in which
commits to delivering weekly 50 units of product 1 and 100 units of
any combination of products II and III, depending on production, but only one
maximum of 25 units of product IV. How many units of each product should I have?
manufacture weekly the company in order to meet all the conditions of the
contract and maximize total profit?
Consider the incomplete pieces as a Linear Programming model.

Solution:

What are we going to minimize?

x1the quantity to be produced of product I

x2the quantity to be produced of product II
x3the quantity to be manufactured of product III
x4the quantity to produce 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 36:

Four products are processed successively on two machines. The times of

Manufacturing hours per unit of each product are 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 a unit of each product is directly based on the
machine time. Assume that the cost per hour for machines 1 and 2 is $10 and
$15. The total hours budgeted for all products on machines 1 and 2
They are 500 and 380. If the selling price per unit for products 1, 2, 3, and 4 is $65,
$70, $55, and $45, formulate the problem as a linear programming model for
maximize the total net profit.

Solution:
What are we going to maximize?

x1the quantity to produce of product 1

x2the quantity to be produced of product 2
x3the quantity to be produced of product 3
x4the quantity to be produced 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, x40

Problem 37:

Delta company has specialized machinery in the plastic industry.

the company is set to start operations next January and has
$300,000 and ten machines. The operation of each machine requires $4,000.00.
start 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 be at the beginning of the seventh month, at
maximum number of machines in operation.

At the beginning of each month, the company has three options available for acquisition.
machinery. In the first alternative, you can buy a machine for $20,000.00 each.
with a delivery period of one month. That is, if at the beginning of each month 't' is requested and
Pay for the machinery, 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
The delivery period is in two months. The last alternative is to buy for $10,000.00
each machine with a delivery period of three months.

Formulate a linear programming model that allows determining the purchasing policy.
of machinery, production, and payment of operators each month, in such a way that by
At the beginning of the seventh month, there should be the maximum number of machines in operation.

Solution:

What are we going to minimize?

x1the quantity to manufacture 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+ x3100
x4< 25
x1, x2, x3, x40

Problem 38:

A chemical company that operates 24 hours a day has the

next needs for technical and specialized personnel

Period Time of the day Technical personnel Personal

Specialized
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
The company works 8 consecutive hours. Suppose that Xty Zt, they denote the number of
technical and specialized personnel, respectively, who start working at the beginning
of period t each day. In this company, the union agreement establishes that in all
There must be at least three times the number of technical staff than
specialized personnel. Establish a linear programming model to determine
the minimum number of technical and specialized staff to meet the needs
work days in the company.

Solution:

xiRthe amount of technical staff

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

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

National Railways of Mexico has the following demand at the beginning of next year
of diesel locomotives to occupy their system throughout the country:

Quarter 1 2 3
Locomotives 750 800 780
Diesel

The railway 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.
from any quarter
c) Repair locomotives in the national workshops on a regular basis. The time re
the repair is for 6 months.
d) Report locomotives in the national workshops urgently. The time
The repair period is 3 months.

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

Alternative c has a cost of $100,000 per locomotive
Option 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
the operating budget for that year is $100,000,000 delivered in installments
quarterly of 40, 30, 20, and 10 million respectively.

It is supposed that at the end of each quarter, 5% of the locomotives must be maintained.
repair and 5% are out of service. Formulate a programming problem
linear that allows to determine the combination of policies that should be taken into account
management of railways to minimize costs and meet the demand for locomotives.

Solution:

What are we going to minimize?

x1the Quantity of Demand in quarter 1

x2the Demand Quantity in the second quarter
x3the Quantity of Demand in the third quarter

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

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

Problem 40:

A company produces brown sugar, white sugar, powdered sugar, and molasses.
with sugar cane syrup. The company buys 4000 tons of syrup from
the week and has a contract to deliver a minimum of 25 tons weekly of
each type of sugar. The production process begins by manufacturing brown sugar and
molasses with syrup. One ton of syrup produces 0.3 tons of sugar.
brown sugar and 0.1 tons of molasses. After that, white sugar is produced by processing
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 by
through a special grinding process, which has 95% conversion efficiency (1
ton of white sugar produces 0.95 tons of powdered sugar). The
utilities per ton
are 150, 200, 230, and 35 dollars, respectively. Formulate the problem as a
linear program.

Solution:
The production of each type of sugar according to the production process is detailed in
continuation for each ton of material used.

Production per ton.

brownish molasses white powder
Syrup (1 ton) 0.3 0.1
Az. Morena (1tn) 0.8
Blanca (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:
powdered sugar.
The restrictions:
X1 / 0.3 + X2 / 0.1 <= 4000 (Restriction for syrup tin)
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 constraint)
The objective function to maximize profits:
max. z = 150X1 + 200X3 + 230X4 + 35X2

The structure of the model is as follows:

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 constraint)

Problem 41:

Four products are processed in sequence by two machines. The following table
provide the relevant data 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 determine 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:
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.
F: O Max z = 45X11 + 50X21 + 40X12 + 60X22 + 15X13 + 50X23 + 25X14 + 35X24
S.a:
2X11 + 3X12 + 4X13 + 2X14 <= 500 (Capacity constraint 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 work from a jeweler. A type 2 ring requires 3 rubies, 2 sapphires and 2
working hours of a jeweler. Each type 1 ring is sold for 400 dollars, and each type 2 ring, at
500 dollars. All the produced rings can be sold. Currently, there are 100 available.
rubies, 120 sapphires, and 70 hours of work from a jeweler. You can buy more rubies at a cost
from 100 dollars for the ruby. Market demand requires a production of at least
20 rings of type 1 and at least 25 rings of type 2. Formulate the problem to maximize the
profit.

Solution:
Requirement by unit
Type of
ring Availability
Type 1 Type 2
Rubies (unit) 2 3
Sapphires (unit) 3 2
Hours-man 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 on the number of rubies)
3X1 + 2X2 <= 120 (Restriction on the number of sapphires)
X1 + 2X2 <= 70 (Restriction on working hours of a jeweler)
X1 >= 20 (Restriction for demand type 1)
X2 >= 25 (Restriction 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 (Restriction on the amount of rubies)
3X1 + 2X2 <= 120 (Restriction on the amount of sapphires)
X1 + 2X2 <= 70 Working hour restrictions for a jeweler
X1 >= 20 (Restriction for demand type 1)
X2 >= 25 (Restriction for type 2 demand)
X1, X2, X3 >= 0 (Non-negativity constraint)

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

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

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

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

Staffing needs by schedule

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

The personnel restrictions per shift 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 personnel

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

The structure of the model is as follows:

Number of staff 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)