Академический Документы
Профессиональный Документы
Культура Документы
REALIZADO POR:
BOGOTA D.C.
2017
EJERCICIO 1. IDENTIFICACIN DE SNTOMAS RELEVANTES
SINTOMA
ENFERMEDAD
S1 S2 S3 S4 S5 S6 S7 S8
D1 2 3 1 1 1 2 1 2
D2 1 1 1 1 3 1 2 1
D3 3 4 2 3 2 2 3 2
D4 2 2 2 2 2 1 2 3
D5 1 1 1 2 1 1 1 2
Tabla 1. Sntomas asociados a las enfermedades.
Inicialmente se reconoce:
i= Enfermedades
j= Sntomas
Xj= 1 si el sntoma j pertenece al grupo mnimo de sntomas
: =
=1
: = [() ()]
=1
1 () ()
[() ()] = { }
0 () = ()
2. Programacin GAMS
V AR I A B L E S
S1, S2, S3, S4, S5, S6, S7, S8, Z ;
BINARY VARIABLES
S1, S2, S3, S4, S5, S6, S7, S8 ;
FREE VARIABLE
Z;
E Q U AT I O N S
F U N C I O N O B J E T I V O , R E S T1 , R E S T2 , R E S T3 , R E S T4 , R E S T 5 , R E S T6 , R E S T7 , R E S T8 ,
R E S T9 , R E S T1 0 ;
FUNCIONOBJETIVO.. S1 + S2 + S3 + S4 + S5+ S6 + S7+ S8 =E= Z ;
R E S T1 . . 1 * S 1 + 1 * S 2 + 0 * S 3 + 0 * S 4 + 1 * S 5 + 1 * S 6 + 1 * S 7 + 1 * S 8 = G = 1 ;
R E S T2 . . 1 * S 1 + 1 * S 2 + 1 * S 3 + 1 * S 4 + 1 * S 5 + 0 * S 6 + 1 * S 7 + 0 * S 8 = G = 1 ;
R E S T3 . . 0 * S 1 + 1 * S 2 + 1 * S 3 + 1 * S 4 + 1 * S 5 + 1 * S 6 + 1 * S 7 + 1 * S 8 = G = 1 ;
R E S T4 . . 1 * S 1 + 1 * S 2 + 0 * S 3 + 1 * S 4 + 0 * S 5 + 1 * S 6 + 0 * S 7 + 1 * S 8 = G = 1 ;
R E S T5 . . 0 * S 1 + 0 * S 2 + 0 * S 3 + 1 * S 4 + 1 * S 5 + 0 * S 6 + 1 * S 7 + 1 * S 8 = G = 1 ;
R E S T6 . . 1 * S 1 + 1 * S 2 + 1 * S 3 + 1 * S 4 + 1 * S 5 + 1 * S 6 + 1 * S 7 + 1 * S 8 = G = 1 ;
R E S T7 . . 1 * S 1 + 1 * S 2 + 1 * S 3 + 1 * S 4 + 1 * S 5 + 0 * S 6 + 0 * S 7 + 1 * S 8 = G = 1 ;
R E S T8 . . 1 * S 1 + 1 * S 2 + 0 * S 3 + 1 * S 4 + 0 * S 5 + 1 * S 6 + 1 * S 7 + 1 * S 8 = G = 1 ;
R E S T9 . . 1 * S 1 + 1 * S 2 + 1 * S 3 + 1 * S 4 + 1 * S 5 + 1 * S 6 + 1 * S 7 + 0 * S 8 = G = 1 ;
R E S T1 0 . . 1 * S 1 + 1 * S 2 + 1 * S 3 + 0 * S 4 + 1 * S 5 + 0 * S 6 + 1 * S 7 + 1 * S 8 = G = 1 ;
MODEL sintomas /ALL/;
S O L V E s i n t o m a s U S I N G m i p MI N I MI Z I N G Z ;
3. Solucin GAMS
G A MS 2 4 . 8 . 3 r 6 0 2 0 2 R e l e a s e d J a n 2 8 , 2 0 1 7 W I N - V S 8 x8 6 3 2 b i t / MS W in d o ws 0 5 / 2 7 / 1 7
07:54:03 Page 1
G e n e r a l A l g e b r a i c M o d e l i n g S y s t e m
C o m p i l a t i o n
1 VARIABLES
2 S1, S2, S3, S4, S5, S6, S7, S8, Z ;
3
4 BINARY VARIABLES
5 S1, S2, S3, S4, S5, S6, S7, S8 ;
6
7 FREE VARIABLE
8 Z;
9
1 0 E Q U A TI O N S
11 F U N C I O N O B J E TI V O , R E S T1 , R E S T2 , R E S T3 , R E S T4 , R E S T5 , R E S T6 , R E S T7 ,
R E S T8 , R
E S T9 , R E S T1 0 ;
12
1 3 F U N C I O N O B J E TI V O . . S 1 + S 2 + S 3 + S 4 + S 5 + S 6 + S 7 + S 8 = E = Z ;
1 4 R E S T1 . . 1 * S 1 + 1 * S 2 + 0 * S 3 + 0 * S 4 + 1 * S 5 + 1 * S 6 + 1 * S 7 + 1 * S 8 = G = 1 ;
1 5 R E S T2 . . 1 * S 1 + 1 * S 2 + 1 * S 3 + 1 * S 4 + 1 * S 5 + 0 * S 6 + 1 * S 7 + 0 * S 8 = G = 1 ;
1 6 R E S T3 . . 0 * S 1 + 1 * S 2 + 1 * S 3 + 1 * S 4 + 1 * S 5 + 1 * S 6 + 1 * S 7 + 1 * S 8 = G = 1 ;
1 7 R E S T4 . . 1 * S 1 + 1 * S 2 + 0 * S 3 + 1 * S 4 + 0 * S 5 + 1 * S 6 + 0 * S 7 + 1 * S 8 = G = 1 ;
1 8 R E S T5 . . 0 * S 1 + 0 * S 2 + 0 * S 3 + 1 * S 4 + 1 * S 5 + 0 * S 6 + 1 * S 7 + 1 * S 8 = G = 1 ;
1 9 R E S T6 . . 1 * S 1 + 1 * S 2 + 1 * S 3 + 1 * S 4 + 1 * S 5 + 1 * S 6 + 1 * S 7 + 1 * S 8 = G = 1 ;
2 0 R E S T7 . . 1 * S 1 + 1 * S 2 + 1 * S 3 + 1 * S 4 + 1 * S 5 + 0 * S 6 + 0 * S 7 + 1 * S 8 = G = 1 ;
2 1 R E S T8 . . 1 * S 1 + 1 * S 2 + 0 * S 3 + 1 * S 4 + 0 * S 5 + 1 * S 6 + 1 * S 7 + 1 * S 8 = G = 1 ;
2 2 R E S T9 . . 1 * S 1 + 1 * S 2 + 1 * S 3 + 1 * S 4 + 1 * S 5 + 1 * S 6 + 1 * S 7 + 0 * S 8 = G = 1 ;
2 3 R E S T1 0 . . 1 * S 1 + 1 * S 2 + 1 * S 3 + 0 * S 4 + 1 * S 5 + 0 * S 6 + 1 * S 7 + 1 * S 8 = G = 1 ;
24
25
2 6 MO D E L s i n t o m a s / A L L / ;
27
2 8 S O L V E s i n t o m a s U S I N G m i p MI N I MI Z I N G z ;
C O MP I L A TI O N TI ME = 0.015 SECONDS 2 MB 2 4 . 8 . 3 r 6 0 2 0 2 W I N - V S 8
- - - - F U N C I O N O B J E TI V O = E =
- - - - R E S T1 = G =
R E S T1 . . S 1 + S 2 + S 5 + S 6 + S 7 + S 8 = G = 1 ; ( L H S = 0 , I N F E S = 1 * * * * )
- - - - R E S T2 = G =
R E S T2 . . S 1 + S 2 + S 3 + S 4 + S 5 + S 7 = G = 1 ; ( L H S = 0 , I N F E S = 1 * * * * )
- - - - R E S T3 = G =
R E S T3 . . S 2 + S 3 + S 4 + S 5 + S 6 + S 7 + S 8 = G = 1 ; ( L H S = 0 , I N F E S = 1 * * * * )
- - - - R E S T4 = G =
R E S T4 . . S 1 + S 2 + S 4 + S 6 + S 8 = G = 1 ; ( L H S = 0 , I N F E S = 1 * * * * )
- - - - R E S T5 = G =
R E S T5 . . S 4 + S 5 + S 7 + S 8 = G = 1 ; ( L H S = 0 , I N F E S = 1 * * * * )
- - - - R E S T6 = G =
R E S T6 . . S 1 + S 2 + S 3 + S 4 + S 5 + S 6 + S 7 + S 8 = G = 1 ; ( L H S = 0 , I N F E S = 1 * * * * )
- - - - R E S T7 = G =
R E S T7 . . S 1 + S 2 + S 3 + S 4 + S 5 + S 8 = G = 1 ; ( L H S = 0 , I N F E S = 1 * * * * )
- - - - R E S T8 = G =
R E S T8 . . S 1 + S 2 + S 4 + S 6 + S 7 + S 8 = G = 1 ; ( L H S = 0 , I N F E S = 1 * * * * )
- - - - R E S T9 = G =
R E S T9 . . S 1 + S 2 + S 3 + S 4 + S 5 + S 6 + S 7 = G = 1 ; ( L H S = 0 , I N F E S = 1 * * * * )
- - - - R E S T1 0 = G =
R E S T1 0 . . S 1 + S 2 + S 3 + S 5 + S 7 + S 8 = G = 1 ; ( L H S = 0 , I N F E S = 1 * * * * )
MO D E L S TA T I S TI C S
BLOCKS OF EQUATIONS 11 S I N G L E E Q U A TI O N S 11
BLOCKS OF VARIABLES 9 SINGLE VARIABLES 9
N O N Z E R O E L E ME N T S 70 DISCRETE VARIABLES 8
G E N E R A TI O N T I ME = 0.234 SECONDS 3 MB 2 4 . 8 . 3 r 6 0 2 0 2 W I N - V S 8
E XE C U TI O N TI ME = 0.234 SECONDS 3 MB 2 4 . 8 . 3 r 6 0 2 0 2 W I N - V S 8
S O L V E S U M M A R Y
MO D E L s i n t o m a s OBJECTIVE Z
TYPE MI P D I R E C TI O N MI N I MI Z E
SOLVER CPLEX FROM LINE 28
* * * * S O L V E R S T A TU S 1 Normal Completion
* * * * MO D E L S T A TU S 1 Optimal
* * * * O B J E C TI V E V A L U E 2.0000
R E S O U R C E U S A G E , L I MI T 0.125 1000.000
I T E R A TI O N C O U N T, L I MI T 4 2000000000
L OW E R LEVEL UPPER MA R G I N A L
* * * * R E P O R T S U MMA R Y : 0 NONOPT
0 INFEASIBLE
0 UNBOUNDED
E XE C U TI O N TI ME = 0.000 SECONDS 2 MB 2 4 . 8 . 3 r 6 0 2 0 2 W I N - V S 8
U S E R : G A MS D e ve l o p m e n t C o r p o r a t i o n , W as h i ng t o n , D C G 8 7 1 2 0 1 / 0 0 0 0 C A - A N Y
Free Demo, 202-342-0180, sales@gams.com, www.gams.com DC0000
* * * * F I L E S U M MA R Y
RESULTADOS
Resultado
Variables Valor
S1 0
S2 1
S3 0
Variables de S4 1
Valor binario
decisin S5 0
S6 0
S7 0
S8 0
Funcin objetivo Z 2 Valor final
Datos a considerar:
- i: consumidores (7 ciudades).
- j: localizacin de planta en el lugar j (6 posibles lugares).
- Fj: coste de recobrar la inversin a lo largo del horizonte de
estudio de una planta es 10 unidades monetarias.
7 6 6
MAZ COSTO
PLANTA=
=1 =1 =1
=
=1
6
=1
j= 1,,7.
1 si se construye la planta j
=
0 en otro caso
0 ; = 1, ,7; = 1, ,6.
El planteamiento para las restricciones de acuerdo a la demanda de
consumidor i es el siguiente:
- 1 = 1 1 + 1 2 + 1 3 + 1 4 + 1 5 + 1 6 = 1,5
- 2 = 2 1 + 2 2 + 2 3 + 2 4 + 2 5 + 2 6 = 2,0
- 3 = 3 1 + 3 2 + 3 3 + 3 4 + 3 5 + 3 6 = 3,0
- 4 = 4 1 + 4 2 + 4 3 + 4 4 + 4 5 + 4 6 = 4,0
- 5 = 5 1 + 5 2 + 5 3 + 5 4 + 5 5 + 5 6 = 3,5
- 6 = 6 1 + 6 2 + 6 3 + 6 4 + 6 5 + 6 6 = 1,0
- 1 = 7 1 + 7 2 + 7 3 + 7 4 + 7 5 + 7 6 = 2,0
- 1 = 1 1 + 2 1 + 3 1 + 4 1 + 5 1 + 6 1 + 7 1 61
- 2 = 1 2 + 2 2 + 3 2 + 4 2 + 5 2 + 6 2 + 7 2 62
- 3 = 1 3 + 2 3 + 3 3 + 4 3 + 5 3 + 6 3 + 7 3 63
- 4 = 1 4 + 2 4 + 3 4 + 4 4 + 5 4 + 6 4 + 7 4 64
- 5 = 1 5 + 2 5 + 3 5 + 4 5 + 5 5 + 6 5 + 7 5 65
- 6 = 1 6 + 2 6 + 3 6 + 4 6 + 5 6 + 6 6 + 7 6 66
OPTION
OPTCR=0.0001
V AR I A B L E S
* C a d a va r i a b l e C i L j , e s l a r e l a c i n d e l b e n e f i c i o a o b t e n e r d e u n a p l a n t a ( j ) p o r u n a
ciudad (i)*
C1L1, C1L2,C1L3,C1L4,C1L5,C1L6,C2L1,C2L2,C2L3,C2L4,C2L5,C2L6 , C3L1, C3L2,
C3L3, C3L4, C3L5, C3L6,
C4L1,C4L2,C4L3,,C4L5,C4L6,C5L1,C5L2,C5L3,C5L4,C5L5,C5L6,C6L1 ,C6L2, C6L3, C6L4,
C 6 L 5 , C 6 L 6 , C 7 L 1 , C 7 L 2 , C 7 L 3 , C 7 L 4 , C 7 L 5 , C 7 L 6 , Y1 , Y2 , Y3 , Y 4 , Y 5 , Y6 , Z ;
* L a s v a r i a b l e s Y , c o r r e s p o n d e n a l c o s t o d e c o n s t r u c c i n d e c a d a p l a n t a e n l a l o c a l i za c i n
(j)*
FREE VARIABLE
Z;
POSITIVE VARIABLES
C1L1, C1L2,C1L3,C1L4,C1L5,C1L6,C2L1,C2L2,C2L3,C2L4,C2L5,C2L6, C3L1, C3L2,
C3L3, C3L4, C3L5, C3L6,
C4L1,C4L2,C4L3,,C4L5,C4L6,C5L1,C5L2,C5L3,C5L4,C5L5,C5L6,C6L1,C6 L2, C6L3, C6L4,
C6L5, C6L6, C7L1,C7L2,C7L3,C7L4,C7L5,C7L6,
BINARY VARIABLES
Y1 , Y2 , Y3 , Y 4 , Y5 , Y6 ;
* S i e s 1 , s e c o n s t r u ye l a p l a n t a y s i e s 0 n o s e h a c e y s e t o m a o t r a o p c i n *
E Q U AT I O N S
O B J E T I V O , D E MA N D A 1 , D E MA N D A 2 , D E MA N D A 3 , D E MA N D A 4 , D E MA N D A 5 , D E MA N D A 6 ,
D E MA N D A 7 ,
CAPACIDAD1,CAPACIDAD2,CAPACIDAD3,CAPACIDAD4,CAPACIDAD5,CAPACIDAD6;
M O D E L P L A N TA S / A L L / ;
S O L V E P L A N T A S U S I N G MI P MA X I MA X I N G Z ;
3. Solucin GAMS
1 OPTION OPTCR=0.0001
2
3 VARIABLES
4 *Cada variable CiLj, es la relacin del beneficio a obtener de una planta
(j) por una ciudad (i)*
5 C1L1,C1L2,C1L3,C1L4,C1L5,C1L6,C2L1,C2L2,C2L3,C2L4,C2L5,C2L6,C3L1,C3L2,C3L3
,C3L4,C3L5,C3L6,
6 C4L1,C4L2,C4L3,C4L4,C4L5,C4L6,C5L1,C5L2,C5L3,C5L4,C5L5,C5L6,C6L1,C6L2,C6L3
,C6L4,C6L5,C6L6,
7 C7L1,C7L2,C7L3,C7L4,C7L5,C7L6, Y1, Y2, Y3, Y4, Y5, Y6, Z;
8 *Las variables Y, corresponden al costo de construccion de cada planta en
lalocalizacion (j)*
9
10 FREE VARIABLE
11 Z;
12
13 POSITIVE VARIABLES
14 C1L1,C1L2,C1L3,C1L4,C1L5,C1L6,C2L1,C2L2,C2L3,C2L4,C2L5,C2L6,C3L1,C3L2,C3L3
,C3L4,C3L5,C3L6,
15 C4L1,C4L2,C4L3,C4L4,C4L5,C4L6,C5L1,C5L2,C5L3,C5L4,C5L5,C5L6,C6L1,C6L2,C6L3
,C6L4,C6L5,C6L6,
16 C7L1,C7L2,C7L3,C7L4,C7L5,C7L6;
17
18 BINARY VARIABLES
19 Y1, Y2, Y3, Y4, Y5, Y6;
20 *Si es 1, se construye la planta y si es 0 no se hace y se toma otra opci
n*
21
22 EQUATIONS
23 OBJETIVO,
DEMANDA1,DE MANDA2,DEMANDA 3,DE MANDA 4,DE MANDA5,DE MANDA6,DE MANDA7,
24 CAPACIDAD1,CAPACIDAD2,CAPACIDAD3,CAPACIDAD4,CAPACIDAD5,CAPACID AD6;
25 OBJETIVO.. Z =E= 4.0*C1L1 + 4.0*C1L2 + 3.5*C1L3 + 1.3*C1L4 + 0.5*
C1L5 - 1.0*C1L6 +
26 4.5*C2L1 + 4. 5*C2L 2 + 5.0 *C2L3 + 3.0* C2 L4 + 1. 0*
C2L5 + 0.0*C2L6 +
27 2.5*C3L1 + 2. 5*C3L 2 + 4.0 *C3L3 + 5.0* C3 L4 + 1. 5*
C3L5 + 1.5*C3L6 +
28 0.5*C4L1 + 4. 2*C4L 2 + 3.5 *C4L3 + 3.3* C4 L4 + 5. 0*
C4L5 + 3.3*C4L6 +
29 1.0*C5L1 + 3. 5*C5L 2 + 4.5 *C5L3 + 5.5* C5 L4 + 4. 0*
C5L5 + 4.0*C5L6 +
30 0.5*C6L1 + 1. 5*C6L 2 + 1.5 *C6L3 + 1.8* C6 L4 + 5. 5*
C6L5 + 4.5*C6L6 -
31 3.5*C7L1 - 0.5* C7 L2 + 0. 0*C7 L3 + 1.3 *C7L 4 + 3.0*
C7L5 + 2.0*C7L6 -
32 10*Y1 - 10*Y2 - 10*Y3 - 10*Y4 - 1
0*Y5 - 10*Y6;
33
34 *Restricciones de demanda por ciudad, del consumidor i*
35
36 DEMA NDA1.. C1L1 + C1L2 + C1L3 + C1L4 + C1L5 + C1L6 =E= 1.5;
37 DEMANDA2.. C2L1 + C2L2 + C2L3 + C2L4 + C2L5 + C2L6 =E= 2.0;
38 DEMA NDA3.. C3L1 + C3L2 + C3L3 + C3L4 + C3L5 + C3L6 =E= 3.0;
39 DEMA NDA4.. C4L1 + C4L2 + C4L3 + C4L4 + C4L5 + C4L6 =E= 4.0;
40 DEMA NDA5.. C5L1 + C5L2 + C5L3 + C5L4 + C5L5 + C5L6 = E= 2.5;
41 DEMA NDA6.. C6L1 + C6L2 + C6L3 + C6L4 + C6L5 + C6L6 =E= 1.0;
42 DEMA NDA7.. C7L1 + C7L2 + C7L3 + C7L4 + C7L5 + C7L6 =E= 2.0;
43
44 *Restricciones de capacidad de las plantas j*
45
46 CAPACIDAD1.. C1L1 + C2L1 + C3L1 + C4L1 + C5L1 + C6L1 + C7L1 =L= 6*Y1;
47 CAPACIDAD2.. C1L2 + C2L2 + C3L2 + C4L2 + C5L2 + C6L2 + C7L2 =L= 6*Y2;
48 CAPACIDAD3.. C1L3 + C2L3 + C3L3 + C4L3 + C5L3 + C6L3 + C7L3 =L= 6*Y3;
49 CAPACIDAD4.. C1L4 + C2L4 + C3L4 + C4L4 + C5L4 + C6L4 + C7L4 =L= 6*Y4;
50 CAPACIDAD5.. C1L5 + C2L5 + C3L5 + C4L5 + C5L5 + C6L5 + C7L5 =L= 6*Y5;
51 CAPACIDAD6.. C1L6 + C2L6 + C3L6 + C4L6 + C5L6 + C6L6 + C7L6 =L= 6*Y6;
52
53 MODEL PLANTAS /ALL/;
54 SOLVE PLANTAS USING MIP M A XI M A X I N G Z ;
55
MO D E L S TA T I S TI C S
BLOCKS OF EQUATIONS 14 S I N G L E E Q U A TI O N S 14
BLOCKS OF VARIABLES 49 SINGLE VARIABLES 49
N O N Z E R O E L E ME N T S 137 D I S C R E TE V A R I A B L E S 6
G E N E R A TI O N T I ME = 0.032 SECONDS 3 MB 2 4 . 8 . 3 r 6 0 2 0 2 W I N - V S 8
E XE C U TI O N TI ME = 0.032 SECONDS 3 MB 2 4 . 8 . 3 r 6 0 2 0 2 W I N - V S 8
S O L V E S U M M A R Y
MO D E L P L A N T A S O B J E C TI V E Z
TYPE MI P D I R E C TI O N MA XI MI Z E
SOLVER CPLEX FROM LINE 54
* * * * S O L V E R S T A TU S 1 Normal Completion
* * * * MO D E L S T A TU S 1 Optimal
* * * * O B J E C TI V E V A L U E 44.4500
R E S O U R C E U S A G E , L I MI T 0.078 1000.000
I T E R A TI O N C O U N T, L I MI T 22 2000000000
L OW E R LEVEL UPPER MA R G I N A L
* * * * R E P O R T S U MMA R Y : 0 NONOPT
0 INFEASIBLE
0 UNBOUNDED
E XE C U TI O N TI ME = 0.015 SECONDS 2 MB 2 4 . 8 . 3 r 6 0 2 0 2 W I N - V S 8
* * * * F I L E S U M MA R Y
RESULTADOS
Ciudades
Localizacin C1 C2 C3 C4 C5 C6 C7
L2 1,5 2 - 1 - - -
L4 - - 3 - 2,5 - -
L5 - - - 3 - 1 2
Tabla 5. Nmero de plantas ptimas en las ciudades
WEBGRAFIA
http://zeth.ciencias.uchile.cl/~preymond/Otros/optimizacion2./LibroCompleto.pdf