Lower bounds strategies in combinatorial nonlinear programming: a case study: energy generators maintenance and operation scheduling

• Autores: Laureano Fernando Escudero Bueno
• Localización: Questiió: Quaderns d'Estadística, Sistemes, Informatica i Investigació Operativa, ISSN 0210-8054, Vol. 5, Nº. 2, 1981, págs. 85-93
• Idioma: inglés
• Títulos paralelos:
  • 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
• Enlaces
  • Texto completo (pdf)
• Resumen

  • 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.