Lower bounds strategies in combinatorial nonlinear programming. A case study: Energy generators maintenance and operation scheduling.

Título inglés	Lower bounds strategies in combinatorial nonlinear programming. A case study: Energy generators maintenance and operation scheduling.
Título español	Estrategias de cota inferior en programación no lineal combinatoria. Estudio de un caso: catalogación de operación y mantenimiento de generadores de energía.
Autor/es	Escudero, Laureano F.
Organización	Centr. Cient. IBM, Madrid, España
Revista	0210-8054
Publicación	1981, 5 (2): 85-93, 12 Ref.
Tipo de documento	articulo
Idioma	Inglés
Resumen inglés	The Generator Maintenance and Operation Scheduling problem is presented as large-scale mixed integer non-linear programming case. Several relaxations of the integrality condition on the variables are discussed. The optimal solution of the model based on these relaxations is viewed as the lower bound of the optimal solution in the original problem. A continuous constrained non-linear programming algorithm is used in the optimization of the relaxed formulation. Computational experience on a variety of real-life problems is provided.
Clasificación UNESCO	120711
Palabras clave español	Programación no lineal ; Análisis combinatorio ; Punto óptimo
Acceso al artículo completo