Proper Efficiency and Generalized Nonconvex Duality for Vector Minimization Problems

OPSEARCH ◽  
1997 ◽  
Vol 34 (2) ◽  
pp. 105-115 ◽  
Author(s):  
P. Kanniappan ◽  
P. Pandian
Author(s):  
Alexander J. Zaslavski

We study a class of vector minimization problems on a complete metric space such that all its bounded closed subsets are compact. We show that a subclass of minimization problems with a nonclosed set of minimal values is dense in the whole class of minimization problems.


Sign in / Sign up

Export Citation Format

Share Document