Optimality conditions and duality for DC programming in locally convex spaces.
Wang, Xianyun (2009)
Journal of Inequalities and Applications [electronic only]
Similarity:
Wang, Xianyun (2009)
Journal of Inequalities and Applications [electronic only]
Similarity:
Hamala, M., Halická, M. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Chen, Jung-Chih, Lai, Hang-Chin (2002)
Applied Mathematics E-Notes [electronic only]
Similarity:
Tsao, H.-S.Jacob, Fang, Shu-Cherng (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Ivan I. Eremin (2000)
The Yugoslav Journal of Operations Research
Similarity:
Abraham Charnes, William Wager Cooper, Kenneth O. Kortanek (1969)
Aplikace matematiky
Similarity:
The authors deal with a certain specialization of their theory of duality on the case where the objective function is simple continuously differentiable and convex on the set of the admissible solutions and the constraint functions defining are continuously differentiable and concave. Further, a way is shown how to generalize the account to the case where the constraint functions of the problem are simple piecewise differentiable and concave. The obtained conditions can be considered...
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.
T. O. M. Kronsjö (1968)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
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.