Local-global efficiency properties for multiobjective max-min programming

Abstract

The purpose of this paper is to give sufficient conditions of generalized concavity and convexity type for a local (weakly) max-min efficient solution to be a global (weakly) max-min efficient solution for an vector maxmin programming problem. In the particular case of the vector max-min pseudomonotonic programming problem{}, we derive some characterizations properties of max-min efficient and properly max-min efficient solutions .

Keywords

• vector programming
• pseudomonotonic programming
• max-min efficiency
• proper max-min efficiency