Lagrangian relaxation of the generic materials and operations planning model
Artículo de revista
2018
Central European Journal of Operations Research
https://doi.org/DOI: 10.1007/s10100-018-0593-0
1435246X
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.
- Artículos científicos [2641]
Descripción:
Lagrangian relaxation of the generic materials and operations planning model.pdf
Título: Lagrangian relaxation of the generic materials and operations planning model.pdf
Tamaño: 5.948Kb
PDF
LEER EN FLIP
Título: Lagrangian relaxation of the generic materials and operations planning model.pdf
Tamaño: 5.948Kb


