Interactive Method for Solving Multi-Objective Convex Programs
Emina Krčmar-Nožić (1991)
The Yugoslav Journal of Operations Research
Similarity:
Emina Krčmar-Nožić (1991)
The Yugoslav Journal of Operations Research
Similarity:
Tadeusz Antczak (2007)
Control and Cybernetics
Similarity:
Leo Liberti (2009)
RAIRO - Operations Research
Similarity:
A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are widespread in mathematical programming but interestingly they have never been studied under a unified framework. This paper attempts...
Matthias Knobloch (2004)
Kybernetika
Similarity:
We consider general convex large-scale optimization problems in finite dimensions. Under usual assumptions concerning the structure of the constraint functions, the considered problems are suitable for decomposition approaches. Lagrangian-dual problems are formulated and solved by applying a well-known cutting-plane method of level-type. The proposed method is capable to handle infinite function values. Therefore it is no longer necessary to demand the feasible set with respect to the...
José Luis Quintero, Alejandro Crema (2006)
RAIRO - Operations Research
Similarity:
The multiparametric min max 0-1-Integer Programming (0-1-IP) problem relative to the objective function is a family of min max 0-1-IP problems which are related by having identical constraint matrix and right-hand-side vector. In this paper we present an algorithm to perform a complete multiparametric analysis relative to the objective function.
Yanjin Wang, Pusheng Fei (2009)
Control and Cybernetics
Similarity: