Lower bound strategies in combinatorial non-linear programming. A case study: energy generators maintenance and operation scheduling
Visualitza/Obre
Tipus de documentArticle
Data publicació1981-06
EditorUniversitat Politècnica de Barcelona. Centre de Càlcul
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 2.5 Espanya
Abstract
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.
ISSN0210-8054 (versió paper)
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
article.pdf | 545,2Kb | Visualitza/Obre |