Duality of transformation functions in the interior point methods.
Halická, M., Hamala, M. (1996)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Halická, M., Hamala, M. (1996)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Tsao, H.-S.Jacob, Fang, Shu-Cherng (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Wang, Xianyun (2009)
Journal of Inequalities and Applications [electronic only]
Similarity:
Massimiliano Ferrara, Maria Viorica Stefanescu (2008)
The Yugoslav Journal of Operations Research
Similarity:
Ivan I. Eremin (2000)
The Yugoslav Journal of Operations Research
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.
Tran Quoc Chien (1984)
Kybernetika
Similarity:
Luka Neralić, Sanjo Zlobec (1996)
Applications of Mathematics
Similarity:
We find conditions, in multi-objective convex programming with nonsmooth functions, when the sets of efficient (Pareto) and properly efficient solutions coincide. This occurs, in particular, when all functions have locally flat surfaces (LFS). In the absence of the LFS property the two sets are generally different and the characterizations of efficient solutions assume an asymptotic form for problems with three or more variables. The results are applied to a problem in highway construction,...
Kim, Do Sang, Son, Ta Quang (2011)
Fixed Point Theory and Applications [electronic only]
Similarity: