B. Hernández-Jiménez

Characterization of Weakly Efficient Solutions for Non-Regular Multiobjective Programming Problems with Inequality-Type Constraints

Necessary conditions of optimality are presented for weakly efficient solutions to multiobjective minimization problems with inequality-type constraints. These conditions are applied when the constraints do not necessarily satisfy any regularity assumptions and they are based on the concept of 2-regularity introduced b...

Characterization of Weakly Efficient Solutions for Non-Regular Multiobjective Programming Problems with Inequality-Type Constraints ∗

Characterization of Weakly Efficient Solutions for Nonlinear Multiobjective Programming Problems. Duality

Convexity and generalized convexity play a central role in mathematical programming for duality results and in order to characterize the solutions set. In this paper, taking in mind Craven's notion of K-invexity function (when K is a cone in \mathbb{R}^n R n ) and Martin's notion of Karush-Kuh...