3.4-8. Larry Edison is the director of the Computer Center for Buckly College.

He now needs
to schedule the staffing of the center. It is open from 8 A.M. until midnight. Larry has
monitored the usage of the center at various times of the day, and determined that the
following number of computer consultants are required:

Two types of computer consultants can be hired: full-time and part-time. The full-time
consultants work for 8 consecutive hours in any of the following shifts: morning (8 A.M.–4
P.M.), afternoon (noon–8 P.M.), and evening (4 P.M.–midnight). Full-time consultants are
paid $40 per hour.

Part-time consultants can be hired to work any of the four shifts listed in the above table.
Part-time consultants are paid $30 per hour.

An additional requirement is that during every time period, there must be at least two
full-time consultants on duty for every part-time consultant on duty.

Larry would like to determine how many full-time and how many part-time workers should
work each shift to meet the above requirements at the minimum possible cost.

Solución

Tipos de consultores informáticos

Tiempo completo Tiempo parcial

Turno Turno Turno Turno Turno Turno Turno Turno Demanda

1 2 3 4 1 2 3 4 mínima por
turno

4 Turno
X X 1

8 Turno
X X X 2

10 Turno
X X X 3

6 Turno
X X 4
Datos:

● Tiempo completo: $40/hr Costos: $320

● Tiempo parcial: $30/hr Costos: $120
● En cada turno debe haber al menos 2 de tiempo completo por cada tiempo parcial.

Tiempo completo (TC) Tiempo parcial (TP)

2 1

4 2

6 3

𝑇𝐶 ≥ 2𝑇𝑃

𝑋𝑖,𝑗 = # 𝑑𝑒 𝑐𝑜𝑛𝑠𝑢𝑙𝑡𝑜𝑟𝑒𝑠 𝑑𝑒 𝑡𝑖𝑝𝑜 𝑖 𝑒𝑛 ℎ𝑜𝑟𝑎𝑟𝑖𝑜 𝑗

3 4
Función objetivo (costos)→ 𝑀𝑖𝑛 𝑍 = ∑ 320𝑥1,𝑗 + ∑ 120𝑥2,𝑗
1 1
Restricciones:
Turno 1→ 𝑋1,1 + 𝑋2,1 ≥ 4 𝑋1,1 ≥ 2𝑋2,1
Turno 2→ 𝑋1,1 + 𝑋1,2 + 𝑋2,2 ≥ 8 𝑋1,1 + 𝑋1,2 ≥ 2𝑋2,2
Turno 3→ 𝑋1,2 + 𝑋1,3 + 𝑋2,3 ≥ 10 𝑋1,2 + 𝑋1,3 ≥ 𝑋2,3
Turno 4→ 𝑋1,3 + 𝑋2,4 ≥ 6 𝑋1,3 ≥ 2𝑋2,4
𝑋𝑖,𝑗 ≥ 0 ∀ 𝑖{1, 2} 𝑗{1, 4}
*Ejemplo 3.4 tiempo completo y parcial.
Sets
i 'Tiempo completo y parcial' /1*2/
j 'Turnos de horarios' /1*4/
;

Variables
z 'Costo de los consultores'
x(i,j) 'Tiempo completo/parcial i, turnos j'
Integer Variables x;

Equations
FO 'Función Objetivo'
T1 'turno 1'
T2 'turno 2'
T3 'turno 3'
T4 'turno 4'
TR1 'Turno 1*2'
TR2 'Turno 2*2'
TR3 'Turno 3*2'
TR4 'Turno 4*2'

;
*Modelo
FO..
z=E=320*(x('1','1')+x('1','2')+x('1','3'))+120*(x('2','1')+x('2','2')+x('2','3')+x(
'2','4'))
T1.. x('1','1')+x('2','1')=G=4;
T2.. x('1','1')+x('1','2')+x('2','2')=G=8;
T3.. x('1','2')+x('1','3')+x('2','3')=G=10;
T4.. x('1','3')+x('2','4')=G=6;
TR1.. X('1','1')=G=2*(x('2','1'));
TR2.. X('1','1')+X('1','2')=G=2*(x('2','2'));
TR3.. X('1','2')+X('1','3')=G=2*(x('2','3'));
TR4.. X('1','3')=G=(2*(x('2','4')));

model Ejemplo3 /all/;

solve Ejemplo3 using Mip minimizing z;

Resultado: 4160

3.4-9. The Medequip Company produces precision medical diagnostic equipment at two
factories. Three medical centers have placed orders for this month’s production output. The
table below shows what the cost would be for shipping each unit from each factory to each
of these customers. Also shown are the number of units that will be produced at each factory
and the number of units ordered by each customer.

A decision now needs to be made about the shipping plan for how many units to ship from
each factory to each customer.

Solución

𝑋𝑖,𝑗 = # 𝑑𝑒 𝑢𝑛𝑖𝑑𝑎𝑑𝑒𝑠 𝑓á𝑏𝑟𝑖𝑐𝑎 𝑖 𝑝𝑎𝑟𝑎 𝑐𝑙𝑖𝑒𝑛𝑡𝑒 𝑗

Función objetivo (Costos por unidad)

→ 𝑀𝑖𝑛 𝑍 = 600𝑋1,1 + 800𝑋1,2 + 700𝑋1,3 + 400𝑋2,1 + 900𝑋2,2 + 600𝑋2,3

Restricciones:
𝑋1,1 + 𝑋1,2 + 𝑋1,3 = 400
𝑋2,1 + 𝑋2,2 + 𝑋2,3 = 500
𝑋1,1 + 𝑋2,1 = 300
𝑋1,2 + 𝑋2,2 = 200
𝑋1,3 + 𝑋2,3 = 400
𝑋𝑖,𝑗 ≥ 0 ∀ 𝑖{1, 2} 𝑗{1, 2, 3}

*Ejemplo 3.4-9 Fabricas

Sets
 i 'fabrica' /1*2/
j 'cliente' /1*3/
;

Variable
z 'Costo de envio'
x(i,j) '# de unidades de fabrica i, para cliente j'
Integer Variables x;
Equation
Fo 'Funcion objetivo'
R1 'Restriccion 1'
R2 'Restriccion 2'
R3 'Restriccion 3'
R4 'Restriccion 4'
R5 'Restriccion 5'
;
*Modelo
Fo..
Z=E=600*(x('1','1'))+800*(x('1','2'))+700*(x('1','3'))+400*(x('2','1'))+900*
(x('2','2'))+600*(x('2','3'));
R1.. x('1','1')+x('1','2')+x('1','3')=E=400;
R2.. x('2','1')+x('2','2')+x('2','3')=E=500;
R3.. x('1','1')+x('2','1')=E=300;
R4.. x('1','2')+x('2','2')=E=200;
R5.. x('1','3')+x('2','3')=E=400;

model Ej_Fabricas /all/;

solve Ej_Fabricas using Mip minimizing z;

3.4-10. United Airways is adding more flights to and from its hub airport, so it needs to hire
additional customer service agents. However, it is not clear just how many more should be
hired. Management recognizes the need for cost control while also consistently providing a
satisfactory level of service to customers. Therefore, an OR team is studying how to
schedule the agents to provide satisfactory service with the smallest personnel cost.

Based on the new schedule of flights, an analysis has been made of the minimum number of
customer service agents that need to be on duty at different times of the day to provide a
satisfactory level of service. This has led to compiling the data given in the following table:
The rightmost column of the table shows the number of agents needed for the time periods
given in the first column. The other entries in this table reflect one of the provisions in the
company’s current contract with the union that represents the customer service agents. The
provision is that each agent work an 8-hour shift 5 days per week, and the authorized shifts
are:

Checkmarks in the main body of the table show the hours covered by the respective shifts.
Because some shifts are less desirable than others, the wages specified in the contract differ
by shift. For each shift, the daily compensation (including benefits) for each agent is shown
in the bottom row. The problem is to determine how many agents should be assigned to the
respective shifts each day to minimize the total personnel cost for agents, based on this
bottom row, while meeting (or surpassing) the service requirements given in the rightmost
column.

Solución

3.4-11. Al Ferris has $60,000 that he wishes to invest now in order to use the accumulation
for purchasing a retirement annuity in 5 years. After consulting with his financial adviser, he
has been offered four types of fixed-income investments, which we will label as investments
A, B, C, D.
Investments A and B are available at the beginning of each of the next 5 years (call them
years 1 to 5). Each dollar invested in A at the beginning of a year returns $1.40 (a profit of
$0.40) 2 years later (in time for immediate reinvestment). Each dollar invested in B at the
beginning of a year returns $1.70 three years later.

Investments C and D will each be available at one time in the future. Each dollar invested in
C at the beginning of year 2 returns $1.90 at the end of year 5. Each dollar invested in D at
the beginning of year 5 returns $1.30 at the end of year 5.

Al wishes to know which investment plan maximizes the amount of money that can be
accumulated by the beginning of year 6.

(a)All the functional constraints for this problem can be expressed as equality constraints. To
do this, let At, Bt, Ct, and Dt be the amount invested in investment A, B, C, and D,
respectively, at the beginning of year t for each t where the investment is available and will
mature by the end of year 5. Also let Rt be the number of available dollars not invested at
the beginning of year t (and so available for investment in a later year). Thus, the amount
invested at the beginning of year t plus Rt must equal the number of dollars available for
investment at that time. Write such an equation in terms of the relevant variables above for
the beginning of each of the 5 years to obtain the five functional constraints for this problem.

Solución

∴ las variables quedarían

𝑥𝑖𝑗 = Cantidad de dólares invertidas por el método i en el año j

i = Fixed income (A, B, C, D)

j = Año (1, 2, 3, 4, 5)

Restricciones
Función Objetivo

3.4-12. The Metalco Company desires to blend a new alloy of 40 percent tin, 35 percent
zinc, and 25 percent lead from several available alloys having the following properties:

The objective is to determine the proportions of these alloys that should be blended to
produce the new alloy at a minimum cost.

(a)Formulate a linear programming model for this problem.

(b)Solve this model by the simplex method.

Solución
𝑋𝑖 = 𝐶𝑎𝑛𝑡𝑖𝑑𝑎𝑑 𝑑𝑒 𝑎𝑙𝑒𝑎𝑐𝑖ó𝑛 𝑖

Función objetivo (Costos/lb) → 𝑀𝑖𝑛 𝑍 = 22𝑋1 + 20𝑋2 + 25𝑋3 + 24𝑋4 + 27𝑋5

Restricciones:
% de estaño→ 60𝑋1 + 25𝑋2 + 45𝑋3 + 20𝑋4 + 50𝑋5 = 40
% de zinc→ 10𝑋1 + 15𝑋2 + 45𝑋3 + 50𝑋4 + 40𝑋5 = 35
 % de plomo→ 30𝑋1 + 60𝑋2 + 10𝑋3 + 30𝑋4 + 10𝑋5 = 25
% de total→ 𝑋1 + 𝑋2 + 𝑋3 + 𝑋4 + 𝑋5 = 1
𝑋𝑖 ≥ 0 ∀ 𝑖{1, 2, 3, 4, 5}

3.4-13 A cargo plane has three compartments for storing cargo: front, center, and back.
These compartments have capacity limits on both weight and space, as summarized below:

Furthermore, the weight of the cargo in the respective compartments must be the same
proportion of that compartment’s weight capacity to maintain the balance of the airplane.

The following four cargoes have been offered for shipment on an upcoming flight as space is
available:

Any portion of these cargoes can be accepted. The objective is to determine how much (if
any) of each cargo should be accepted and how to distribute each among the compartments
to maximize the total profit for the flight.

(a)Formulate a linear programming model for this problem.

C (b)Solve this model by the simplex method to find one of its multiple optimal solutions.

Solución
Variables

Xij = Toneladas de la carga i en el compartimiento j

.i = carga (1, 2, 3, 4)

.j = compartimiento (Delantero (1) , Central (2), Trasero (3))

Función Objetivo Maximizar

Z (Max) = 320X11 + 320X12 + 320X13 + 400X21 + 400X22 + 400X23 + 360X31 + 360X32 +

360X33 + 290X41 + 290X42 + 290X43.
Sujeto a:
1X11 + 1X21 + 1X31 + 1X41 <=12
1X12 + 1X22 + 1X32 + 1X42 <=18
1X13 + 1X23 + 1X33 + 1X43 <=10
1X11 + 1X12 + 1X13 <= 20
1X21 + 1X22 + 1X23 <= 16
X31 + 1X32 + 1X33 <= 25
1X41 + 1X42 + 1X43 <= 13
500X11 + 700X21 + 600X31 + 400X41 <= 7000
500X12 + 700X22 + 600X32 + 400X42 <= 9000
500X13 + 700X23 + 600X33 + 400X43 <= 5000
1/12X11– 1/18X12+ 1/12X21- 1/18X22+ 1/12X31– 1/18X32+ 1/12X41- 1/18X42 = 0
1/12X11– 1/10X13+ 1/12X21- 1/10X23+ 1/12X31– 1/10X33+ 1/12X41- 1/10X43 = 0
1X11 >=0
1X12 >=0
1X13 >=0
1X21 >=0
1X22 >=0
1X23 >=0
1X31 >=0
1X32 >=0
1X33 >=0
1X41 >=0
1X42 >=0
1X43 >=0

3.4-14. Oxbridge University maintains a powerful mainframe computer for research use by
its faculty, Ph.D. students, and research associates. During all working hours, an operator
must be available to operate and maintain the computer, as well as to perform some
programming services. Beryl Ingram, the director of the computer facility, oversees the
operation.

It is now the beginning of the fall semester, and Beryl is confronted with the problem of
assigning different working hours to her operators. Because all the operators are currently
enrolled in the university, they are available to work only a limited number of hours each day,
as shown in the following table.
There are six operators (four undergraduate students and two graduate students). They all
have different wage rates because of differences in their experience with computers and in
their programming ability. The above table shows their wage rates, along with the maximum
number of hours that each can work each day.

Each operator is guaranteed a certain minimum number of hours per week that will maintain
an adequate knowledge of the operation. This level is set arbitrarily at 8 hours per week for
the undergraduate students (K. C., D. H., H. B., and S. C.) and 7 hours per week for the
graduate students (K. S. and N. K.).

The computer facility is to be open for operation from 8 A.M. to 10 P.M. Monday through
Friday with exactly one operator on duty during these hours. On Saturdays and Sundays, the
computer is to be operated by other staff.

Because of a tight budget, Beryl has to minimize cost. She wishes to determine the number
of hours she should assign to each operator on each day.

(a)Formulate a linear programming model for this problem.

(b)Solve this model by the simplex method.

3.6-1. The Philbrick Company has two plants on opposite sides of the United States. Each of
these plants produces the same two products and then sells them to wholesalers within its
half of the country. The orders from wholesalers have already been received for the next 2
months (February and March), where the number of units requested are shown below. (The
company is not obligated to completely fill these orders but will do so if it can without
decreasing its profits.)

Each plant has 20 production days available in February and 23 production days available in
March to produce and ship these products. Inventories are depleted at the end of January,
but each plant has enough inventory capacity to hold 1,000 units total of the two products if
an excess amount is produced in February for sale in March. In either plant, the cost of
holding inventory in this way is $3 per unit of product 1 and $4 per unit of product 2.

Each plant has the same two production processes, each of which can be used to produce
either of the two products. The production cost per unit produced of each product is shown
below for each process in each plant.
The production rate for each product (number of units produced per day devoted to that
product) also is given for each process in each plant below.

The net sales revenue (selling price minus normal shipping costs) the company receives
when a plant sells the products to its own customers (the wholesalers in its half of the
country) is $83 per unit of product 1 and $112 per unit of product 2. However, it also is
possible (and occasionally desirable) for a plant to make a shipment to the other half of the
country to help fill the sales of the other plant. When this happens, an extra shipping cost of
$9 per unit of product 1 and $7 per unit of product 2 is incurred.

Management now needs to determine how much of each product should be produced by
each production process in each plant during each month, as well as how much each plant
should sell of each product in each month and how much each plant should ship of each
product in each month to the other plant’s customers. The objective is to determine which
feasible plan would maximize the total profit (total net sales revenue minus the sum of the
production costs, inventory costs, and extra shipping costs).

(a)Formulate a complete linear programming model in algebraic form that shows the
individual constraints and decision variables for this problem.

C (b)Formulate this same model on an Excel spreadsheet instead. Then use the Excel
Solver to solve the model.

C (c)Use MPL to formulate this model in a compact form. Then use a MPL solver to solve
the model.

C (d)Use LINGO to formulate this model in a compact form. Then use the LINGO solver to
solve the model.

P2.- O.J. Juice Company vende naranjas en dos formatos: bolsas de naranjas y jugo de
naranja en envases de cartón. O.J. clasifica las naranjas según una escala de 1 (malas) a
10 (excelente). O.J. dispone en la actualidad de 100,000 lb de naranjas grado 9 y 120,000 lb
de naranjas grado 6. La calidad promedio de naranjas vendidas en bolsas debe ser por lo
menos de 7, y la calidad promedio de naranjas utilizadas para fabricas el jugo de naranja
debe ser por lo menos de 8. Cada libra de naranja que se usa para el jugo rinde un ingreso
de $1.50 dólares, e incurre en un costo variable (que consiste en costos de manos de obra,
costo generales variables, costos de inventarios, entre otros) de $1.05 dólares. Cada libra
de naranjas que se vende en bolsa contribuye con un ingreso de $0.50 dólares e incurre en
un costo variable de $0.20 dólares. Formule un PL para ayudar a O.J. a maximizar su
utilidad.

Solucion:

P3. James Beerd hornea pasteles de queso y pasteles de Selva Negra. Durante
cualquier mes puede hornear cuando mucho 65 pasteles. Los costos por pastel y la
demanda de pasteles, la cual se debe cumplir a tiempo, se proporcionan en la
siguiente tabla. Cuesta 50 centavos conservar un pastel de queso y 40 centavos
conservar un pastel de la Selva Negra en inventario por un mes. Se cuenta con un
inventario inicial de 3 pasteles de queso y 2 de selva negra, pero al final del mes 3
no deberá dejar pasteles en el inventario
Plantee un PL para minimizar el costo total por cumplir la demanda de los tres
meses siguientes