Show simple item record

dc.contributor.authorEscudero, L. F.
dc.date.accessioned2008-02-29T11:52:16Z
dc.date.available2008-02-29T11:52:16Z
dc.date.issued1981-06
dc.identifier.issn0210-8054 (versió paper)
dc.identifier.urihttp://hdl.handle.net/2099/4417
dc.description.abstractThe 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.
dc.format.extentp. 85-93
dc.language.isoeng
dc.publisherUniversitat Politècnica de Barcelona. Centre de Càlcul
dc.relation.ispartofQüestiió. 1981, vol.5, núm.2
dc.rightsAttribution-NonCommercial-NoDerivs 2.5 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/es/
dc.subject.otherMathematical programming
dc.titleLower bound strategies in combinatorial non-linear programming. A case study: energy generators maintenance and operation scheduling
dc.typeArticle
dc.subject.lemacProgramació (Matemàtica)
dc.subject.amsClassificació AMS::90 Operations research, mathematical programming::90C Mathematical programming
dc.rights.accessOpen Access
local.ordre4


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record