Lagrangean decomposition for integer programming : theory and applications
Monique Guignard, Siwhan Kim (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Monique Guignard, Siwhan Kim (1987)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
H. Idrissi, O. Lefebvre, C. Michelot (1988)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Letizia Pellegrini (1998)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
P F. Körner (1991)
Applicationes Mathematicae
Similarity:
Nebojša V. Stojković (2001)
The Yugoslav Journal of Operations Research
Similarity:
Tsao, H.-S.Jacob, Fang, Shu-Cherng (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Shyam S. Chadha (1988)
Trabajos de Investigación Operativa
Similarity:
Duality of linear programming is used to establish an important duality theorem for a class of non-linear programming problems. Primal problem has quasimonotonic objective function and a convex polyhedron as its constraint set.
Popescu, Elena (2003)
Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
Similarity:
Halická, M., Hamala, M. (1996)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
J. Gondzio, D. Tachat (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Letizia Pellegrini (2004)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper we present the image space analysis, based on a general separation scheme, with the aim of studying lagrangian duality and shadow prices in Vector Optimization. Two particular kinds of separation are considered; in the linear case, each of them is applied to the study of sensitivity analysis, and it is proved that the derivatives of the perturbation function can be expressed in terms of vector Lagrange multipliers or shadow prices.