Lower bounds strategies in combinatorial nonlinear programming. A case study: Energy generators maintenance and operation scheduling.
Qüestiió (1981)
- Volume: 5, Issue: 2, page 85-93
- ISSN: 0210-8054
Access Full Article
topAbstract
topHow to cite
topEscudero, Laureano F.. "Lower bounds strategies in combinatorial nonlinear programming. A case study: Energy generators maintenance and operation scheduling.." Qüestiió 5.2 (1981): 85-93. <http://eudml.org/doc/39978>.
@article{Escudero1981,
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.},
author = {Escudero, Laureano F.},
journal = {Qüestiió},
keywords = {Programación no lineal; Análisis combinatorio; Punto óptimo},
language = {eng},
number = {2},
pages = {85-93},
title = {Lower bounds strategies in combinatorial nonlinear programming. A case study: Energy generators maintenance and operation scheduling.},
url = {http://eudml.org/doc/39978},
volume = {5},
year = {1981},
}
TY - JOUR
AU - Escudero, Laureano F.
TI - Lower bounds strategies in combinatorial nonlinear programming. A case study: Energy generators maintenance and operation scheduling.
JO - Qüestiió
PY - 1981
VL - 5
IS - 2
SP - 85
EP - 93
AB - 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.
LA - eng
KW - Programación no lineal; Análisis combinatorio; Punto óptimo
UR - http://eudml.org/doc/39978
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.