Scribd
Upload
26 views11 pages

Examen T1

The document describes an optimization problem with variables Xi representing the location of cinemas and binary variables. The objective is to minimize the total cost of movies and travel. The constraints include visiting certain cinemas. The optimal solution has a cost of 169.35 visiting cinemas A, C, D and E.

Uploaded by

Jeferson Carrasco laura
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
26 views11 pages

Examen T1

The document describes an optimization problem with variables Xi representing the location of cinemas and binary variables. The objective is to minimize the total cost of movies and travel. The constraints include visiting certain cinemas. The optimal solution has a cost of 169.35 visiting cinemas A, C, D and E.

Uploaded by

Jeferson Carrasco laura
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 11

1- Variables

Xi = Localizacion del Cine


i = 1, A, B, C, D, E, F
Xi es Binario

2- Funcion Objetiva
COSTO TOTAL Costo total en pelicula + Costo de Viaje

MIN Z = 15.9X1+35.25XA+37.5XB+42XC+44.85XD+47.25XE+51XF

3- Restricciones
X1+XA+XC+XE ≥ 1
XB+XD ≥ 1
X1+XE ≥ 1
XD+XF ≥ 1
XB+XE+XF ≥ 1
XA+XF ≥ 1
XB+XD ≥ 1
XA+XC ≥ 1
XC+XF ≥ 1
XE = 1
X1 XA XB XC XD XE XF
15.9 35.25 37.5 42 44.85 47.25 51
0 1 0 1 1 1 0

1 1 1 1
1 1
1 1
1 1
1 1 1
1 1
1 1
1 1
1 1
1

Respuesta
Bill necesita visistar las ciudades A, C, D y E
Tendria un costo minimo de 169.35
Z
169.35

3 ≥ 1
1 ≥ 1
1 ≥ 1
1 ≥ 1
1 ≥ 1
1 ≥ 1
1 ≥ 1
2 ≥ 1
1 ≥ 1
1 = 1
1- Variables
Xi = Capacidad
i= 1,2,3,4,5,6,7
Xi es binario

2- Funcion Objetiva

Costo fijo = 1Y1+1.2Y2+2Y3+1.6Y4+1.8Y5+0.9Y6+1.4Y7

Costo Variable = (400X31+200X71+100X12+200X52+120X43+110X63+200X14+120X24+X180X64+150X74+120X3

MIN Z=1Y1+1.2Y2+2Y3+1.6Y4+1.8Y5+0.9Y6+1.4Y7+ (400X31+200X71+100X12+200X52+120X43+110X63+200X14

3- Restricciones

Y1+Y2+Y3+Y4+Y5+Y6+Y7 ≤ 4

X31+X71 ≤ MY1
X12+X52 ≤ MY2
X43+X63 ≤ MY3
X14+X24+X64+X74 ≤ MY4
X35+X45 ≤ MY5
X16+X26+X56 ≤ MY6
X37+X57+X67 ≤ MY7
M=100000

X12+X14+X16 ≥ 25000
X24+X26 ≥ 50000
X31+X35+X37 ≥ 22500
X43+X45 ≥ 45000
X52+X56+X57 ≥37500
X63+X64+X67 ≥ 30000
X71+X74 ≥15000
20X24+X180X64+150X74+120X35+120X45+50X16+150X26+100X26+100X56+90X37+200X57+70X67)/1000

0X52+120X43+110X63+200X14+120X24+X180X64+150X74+120X35+120X45+50X16+150X26+100X26+100X56+90X37+200X57+70X67)/10
0X56+90X37+200X57+70X67)/1000
Xj + Sj- - Sj+ = dj - pj

J=1
X1 + S1- - S1+ = 20 – 10

J=2
X2 + S2- - S2+ = 98 – 3

J=3
X3 + S3- - S3+ = 100-13

J=4
X4 + S4- - S4+ = 34-15

J=5
X5 + S5- - S5+ = 50-9

J=6
X6 + S6- - S6+ = 44-22

J=7
X7 + S7- - S7+ = 32-17

J=8
X8+ S8- - S8+ = 60-30

J=9
X9+ S9- - S9+ = 80-12

J=10
X10+ S10- - S10+ = 150-16
2- Funcion Objetiva

MIN Z= S1+ + S2+ + S3+ + S4+ + S5 + S6+ + S7+ + S8+ + S9+ S10+

*-X4+X3+Mw ≤ -0.001+15
X9-X7-Mw ≤ -12
1- Variables
Xi = Niveles de produccion de los productos
i = (1,2,3,4)
Xi es continuo

Yi = 1 si la descision de comprar ese producto, 0 en caso contrario


Yi es binaria

2- Funcion Objetiva
MAX Z= 70X1+60X2+90X3+80X4-(50000Y1+40000Y2+70000Y3+60000Y4)

3- Restricciones

Y1+Y2+Y3+Y4 ≤ 2
Y1+Y2+M(1-Z) ≥ Y3
Y1+Y2+MZ ≥ Y4
5X1+3X2+6X3+4X4 ≤ 6000 +MY5
4X1+6X2+3X3+5X4 ≤ 6000+M(1-Y5)

M mayor que 70000

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy