In this paper, we establish theorems of the alternative for a system described by inequalities, equalities and an inclusion, which are generalizations of Tucker's classical theorem of the alternative, and develop Kuhn-Tucker necessary conditions for efficiency to mathematical programs in normed...

This paper deals with multiobjective programming problems with inequality, equality and set constraints involving Dini or Hadamard differentiable functions. A theorem of the alternative of Tucker type is established and from which Kuhn-Tucker necessary conditions for local Pareto minima with...

This paper deals with multiobjective programming problems with inequality, equality and set constraints involving Dini or Hadamard differentiable functions. A theorem of the alternative of Tucker type is established, and from which Kuhn-Tucker necessary conditions for local Pareto minima with...

This paper deals with a multiobjective programming problem involving both equality constraints in infinite dimensional spaces. It is shown that some constraint qualifications together with a condition of interior points are sufficient conditions for the invexity of constraint maps with respect...

Mathematical programs with vanishing constraints constitute a new class of difficult optimization problems with important applications in optimal topology design of mechanical structures. Vanishing constraints usually violate standard constraint qualifications, which gives rise to serious...

This paper is devoted to developing new applications from the limiting subdifferential in nonsmooth optimization and variational analysis to the study of the Lipschitz behavior of the Pareto solution maps in parametric nonconvex semi-infinite vector optimization problems (SIVO for brevity). We...

LetZ be a compact set of the real space ℜ with at leastn + 2 points;f,h1,h2:Z → ℜ continuous functions,h1,h2 strictly positive andP(x,z),x≔(x 0 ,...,x n ) τ ε ℜ n+1 ,z ε ℜ, a polynomial of degree at mostn. Consider a feasible setM ≔ {x ε ℜ n+1 ∣∀z εZ, −h 2 (z) ≤P(x,...

LetZ be a compact set of the real space ℜ with at leastn + 2 points;f,h1,h2:Z → ℜ continuous functions,h1,h2 strictly positive andP(x,z),x≔(x <Subscript>0</Subscript>,...,x <Subscript> n </Subscript>)<Superscript>τ</Superscript> ε ℜ<Superscript> n+1</Superscript>,z ε ℜ, a polynomial of degree at mostn. Consider a feasible setM ≔ {x ε ℜ<Superscript> n+1</Superscript>∣∀z εZ, −h <Subscript>2</Subscript>(z) ≤P(x,...</subscript></superscript></superscript></superscript></subscript></subscript>

We give a generic regularity condition under which each weakly efficient decision making unit in the CCR model of data envelopment analysis is also CCR-efficient. Then we interpret the problem of finding maximal parameters which preserve efficiency of CCR-efficient DMUs under directional...