The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “An approach to finding trade-off solutions by a linear transformation of objective functions”

Tractable algorithms for chance-constrained combinatorial problems

Olivier Klopfenstein (2009)

RAIRO - Operations Research

Similarity:

This paper aims at proposing tractable algorithms to find effectively good solutions to large size chance-constrained combinatorial problems. A new robust model is introduced to deal with uncertainty in mixed-integer linear problems. It is shown to be strongly related to chance-constrained programming when considering pure 0–1 problems. Furthermore, its tractability is highlighted. Then, an optimization algorithm is designed to provide possibly good solutions to chance-constrained...

Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming

John Sylva, Alejandro Crema (2008)

RAIRO - Operations Research

Similarity:

An algorithm for enumerating all nondominated vectors of multiple objective integer linear programs is presented. The method tests different regions where candidates can be found using an auxiliary binary problem for tracking the regions already explored. An experimental comparision with our previous efforts shows the method has relatively good time performance.

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

Laureano F. Escudero (1981)

Qüestiió

Similarity:

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