Métodos Determinísticos

Tarea 1 - Solución de modelos de decisión determinísticos

Elaborado por:
Patrick Handerson Lozano López

Tutora: Deyanira perez Bravo

Grupo: 102016_67

Universidad Nacional Abierta y a Distancia – UNAD

Septiembre 2022
 DESTINO 1 DESTINO 2 DESTINO 3 DESTINO 4 DESTINO 5 FICTICIA
BODEGA 1 180 181 179 170 172 0
BODEGA 2 178 177 180 176 175 0
BODEGA 3 188 186 188 188 198 0
BODEGA 4 176 173 172 171 173 0
BODEGA 5 185 183 185 184 190 0
DEMANDA 1980 1765 1985 2150 1810 115

DESTINO 1 DESTINO 2 DESTINO 3 DESTINO 4 DESTINO 5 FICTICIA

BODEGA 1 0 0 0 2100 0 0
BODEGA 2 150 0 0 10 1810 0
BODEGA 3 1735 0 0 0 0 115
BODEGA 4 0 0 1985 40 0 0
BODEGA 5 95 1765 0 0 0 0
SUMA 1980 1765 1985 2150 1810 115
DEMANDA 1980 1765 1985 2150 1810 115
OFERTA MINZ 1717220
2100
1970
1850
2025
1860

SUMA OFERTA
2100 2100
1970 1970
1850 1850
2025 2025
1860 1860
The solution methods were applied to problems of integer linear programming,
transport and assignment for the search for optimal results that generate the
cheapest possible answers, where we obtained minimum costs and optimal
solutions.

we were able to use different applications and solver methods, where we

compared the results, which were the same, this gives us satisfaction, because
we know that we performed the exercises optimally
 MAQUINA 1 MAQUINA 2 MAQUINA 3 MAQUINA 4 MAQUINA 5 MAQUINA 6
OPERARIO 1 257 257 251 259 246 251
OPERARIO 2 251 245 253 245 254 245
OPERARIO 3 250 255 251 246 254 257
OPERARIO 4 251 246 257 259 245 250
OPERARIO 5 244 257 259 255 255 257
OPERARIO 6 256 250 245 247 250 255

MAQUINA 1 MAQUINA 2 MAQUINA 3 MAQUINA 4 MAQUINA 5 MAQUINA 6

OPERARIO 1 0 0 0 0 1 0
OPERARIO 2 0 0 0 0 0 1
OPERARIO 3 0 0 0 1 0 0
OPERARIO 4 0 1 0 0 0 0
OPERARIO 5 1 0 0 0 0 0
OPERARIO 6 0 0 1 0 0 0
SUMA 1 1 1 1 1 1
DEMANDA 1 1 1 1 1 1

MAQUINA 1 MAQUINA 2 MAQUINA 3 MAQUINA 4 MAQUINA 5 MAQUINA 6

OPERARIO 1 0 0 0 0 1 0
OPERARIO 2 0 0 0 0 0 1
OPERARIO 3 0 0 0 1 0 0
OPERARIO 4 0 1 0 0 0 0
OPERARIO 5 1 0 0 0 0 0
OPERARIO 6 0 0 1 0 0 0
SUMA 1 1 1 1 1 1
1 1 1 1 1 1
 MINZ 1472

SUMA OFERTA
1 1
1 1
1 1
1 1
1 1
1 1

SUMA OFERTA
1 1
1 1
1 1
1 1
1 1
1 1
0
The assignment model is a special case of the transportation model, in which
resources are assigned to activities on a one-to-one basis, noting that the
corresponding matrix must be square. Thus, each resource must be uniquely
assigned to a particular activity or assignment.

The allocation model determines how much computing, memory, and storage
resources are allocated to object types. To define the assignment values, we
were able to represent the model in excel, solver and Operation Research,
where we had optimal results.