Lagrangian relaxation of the generic materials and operations planning model
The supply chain management requires increasingly proposals for the production programming planning that brings together its special singularities. Solving coexisting products and alternative processes or by-products must be allowed by the mathematical programming models. The generic materials and o...
- Autores:
-
Rius Sorolla, Gregorio
Maheut, Julien
Coronado Hernández, Jairo Rafael
Garcia Sabater, Jose Pedro
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2018
- Institución:
- Corporación Universidad de la Costa
- Repositorio:
- REDICUC - Repositorio CUC
- Idioma:
- eng
- OAI Identifier:
- oai:repositorio.cuc.edu.co:11323/1646
- Acceso en línea:
- https://hdl.handle.net/11323/1646
https://repositorio.cuc.edu.co/
- Palabra clave:
- GMOP
Lagrangian relaxation
Subgradient
- Rights
- openAccess
- License
- Atribución – No comercial – Compartir igual
| Summary: | The supply chain management requires increasingly proposals for the production programming planning that brings together its special singularities. Solving coexisting products and alternative processes or by-products must be allowed by the mathematical programming models. The generic materials and operations planning (GMOP) formulation allows operating with different materials and process lists. The paper presents a procedure to solve the versatile GMOP model by the Lagrange Relaxation. The subgradient update method of the lagrangian multiplier is compared with a linear update method. Obtaining lower bound faster compared to the linear method is allowed by the subgradient method, but the linear method provides better solutions after certain iterations. |
|---|