UNIVERSIDAD NACIONAL DE TRUJILLO

FACULTAD DE INGENIERÍA
ESCUELA PROFESIONAL DE INGENIERÍA DE SISTEMAS

INVESTIGACIÓN DE
OPERACIONES II

INTEGRANTES
DOCENTE
- ING. BACA LOPEZ, MARCO GREGORIO

Trujillo – Perú
2
UNIVERSIDAD NACIONAL DE Página 2
TRUJILLO INGENIERÍA DE
SISTEMAS INVESTIGACIÓN DE
OPERACIONES II

I. EJERCICIO PROGRAMACIÓN DINÁMICA DETERMINISTA (INGLÉS)

A 4-ton ship is loaded with one or more of three items. The following table
provides the weight per unit, (Wi), in tons and the utility per unit, Ui in
thousands of dollars per article i. How should the ship be loaded to maximize
total utility?
Item W Ui
si i
1 2 31
2 3 47
3 1 14

the weights per unit, Wi and the maximum weight W assume all integer values,
state Xi can only assume integer values.
Solution
 Stages: For each ítem it’s a stage, that is to say 3 stages (i)
 States: Ship capacity availability (Si)
 Decision: How many units of each item to carry? (Xn)

Stage 3

Stage 2
 Stage 1

Recursive function
fn(Sn,Xn)= Ui(xn)+f*n+1(Sn-Wixn)

II. EJERCICIO 2 PROGRAMACIÓN DINÁMICA DETERMINISTA (INGLÉS)

EXAMPLE Distributing Scientists to Research Teams:

A government space project is conducting research on a certain engineering problem that must be solved before people
can fly safely to Mars. Three research teams are currently trying three different approaches for solving this problem. The
estimate has been made that, under present circumstances, the probability that the respective teams—call them 1, 2, and
3—will not succeed is 0.40, 0.60, and 0.80, respectively. Thus, the current probability that all three teams will fail is
(0.40)(0.60)(0.80) =0.192. Because the objective is to minimize the probability of failure, two more top scientists have
been assigned to the project.
Table 11.2 gives the estimated probability that the respective teams will fail when 0, 1, or 2 additional scientists are
added to that team. Only integer numbers of scientists are considered because each new scientist will need to devote full
attention to one team. The problem is to determine how to allocate the two additional scientists to minimize the
probability that all three teams will fail.
Solution Procedure:
In this case, stage n (n= 1, 2, 3) corresponds to research team n, and the state s n is the number of new scientists still
available for allocation to the remaining teams. The decision variables x n (n= 1, 2, 3) are the number of additional

scientists allocated to team n. Let pi ( xi ) denote the probability of failure for team i if it is assigned xi additional scientists,
as given by Table 11.2. If we let ∏ denote multiplication, the government’s objective is to choose x 1, x 2, x 3so as to
3
Minimize ∏ pi ( xi ) = p1 ( x 1 ) 2 ( x2 ) p3 ( x3 )
i=1

3
Subject ¿ ∑ x i=2
i=1

And x i are nonnegative integers. Consequently f n ( s n , x n )for this problem is

3
f n ( s n , x n )= p n ( x n ) min ∏ pi ( xi )
i=n+1

where the minimum is taken over xn+1, . . . , x3 such that

3

∑ x i=s n
i=1

and xi are nonnegative integers, for n =1, 2, 3. Thus,

f ¿n ( s n )=min f n ( s n , x n ) ; x n=0,1 … , s n
Where
f n ( s n , x n )= p n ( x n )∗f ¿n +1 (s n−x n )
¿
(with f 4 defined to be 1) . Figure 11.7 summarizes these basic relationships.
¿ ¿ ¿
Thus, the recursive relationship relating the f 1 , f 2∧f 3functions in this case is
f ¿n ( s n )=min { p n ( x n )∗f ¿n +1 (s n−x n )}x n =0,1 … , s n , for n=1,2∧when n=3
f ¿3 ( s 3) =min p3 ( x3 ) x 3=0,1 … , s 3
The resulting dynamic programming calculations are as follows:

Therefore, the optimal

solution must have x1 *=
1, which makes s2 =2 - 1
=1, so that x2 *= 0,
which makes s3 =1 - 0 =1,
so that x3 * =1. Thus,
teams 1 and 3 should
each receive one
additional scientist. The
new probability that all
three teams will fail
would then be 0.060.

III. REFERENCIAS BIBLIOGRÁFICAS

 "Introducción a la Investigación Operativa" de Hillier y Lieberman.

 HILLIER, Frederick. - LIEBERMAN, Gerald J. Introducción a la Investigación

de Operaciones. Editorial McGraw-Hill

 TAHA, Hamdy A Investigación de Operaciones. Editorial Alfaomega

 https://www.inf.utfsm.cl/~ccastro/ILI-292/2006-2/SLIDES/programacion-
dinamica-2-ili-292-2006-2-6.pdf.gz
 Bronson, R. Investigación de operacione
(1993). s,
México, Editorial McGrawHill.