Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps.
Xu, Y.D., Li, S.J. (2011)
Journal of Inequalities and Applications [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A convergent algorithm for solving linear programs with an additional reverse convex constraint”
Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps.
Optimality conditions of globally efficient solution for vector equilibrium problems with generalized convexity.
Qiu, Qiusheng (2009)
Journal of Inequalities and Applications [electronic only]
Similarity:
Optimality conditions of vector set-valued optimization problem involving relative interior.
Zhou, Zhiang (2011)
Journal of Inequalities and Applications [electronic only]
Similarity:
Some characterizations of ideal points in vector optimization problems.
Chai, Yan-Fei, Cho, Yeol Je, Li, Jun (2008)
Journal of Inequalities and Applications [electronic only]
Similarity:
Constraint consensus methods for finding interior feasible points in second-order cones.
Weigandt, Anna, Tuthill, Kaitlyn, Jibrin, Shafiu (2010)
Journal of Applied Mathematics
Similarity:
On Tucker's key theorem.
Berman, Abraham, Tarsy, Michael (1978)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Mathematical programming problems involving continuum of inequality constraints
Jaroslav Doležal (1982)
Kybernetika
Similarity:
The barrier cone of a convex set and the closure of the cover.
Bair, J., Dupin, J.C. (1999)
Journal of Convex Analysis
Similarity: