A Note on the McCormick Second-Order Constraint Qualification
The study of optimality conditions and constraint qualification is a key topic in nonlinear optimization. In this work, we present a reformulation of the well-known second-order constraint qualification described by McCormick in [17]. This reformulation
M. D. Sánchez +2 more
doaj +1 more source
On an exact penality result and new constraint qualifications for mathematical programs with vanishing constraints [PDF]
In this paper, we considered the mathematical programs with vanishing constraints or MPVC. We proved that an MPVC-tailored penalty function, introduced in [5], is still exact under a very weak and new constraint qualification.
Nath Triloki, Khare Abeka
doaj +1 more source
On the linear independence constraint qualification in disjunctive programming [PDF]
Mathematical programmes with disjunctive constraints (MPDCs for short) cover several different problem classes from nonlinear optimization including complementarity-, vanishing-, cardinality- and switching-constrained optimization problems. In this paper,
P. Mehlitz
semanticscholar +1 more source
Saddle point criteria for semidefinite semi-infinite convex multiobjective optimization problems [PDF]
In this paper, we consider a nonlinear semidefinite semi-infinite convex multiobjective optimization problem where the feasible region is determined by finite number of equality and infinite number of inequality constraints.
Laha Vivek +2 more
doaj +1 more source
Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs [PDF]
Relaxed constant positive linear dependence constraint qualification (RCPLD) for a system of smooth equalities and inequalities is a constraint qualification that is weaker than the usual constraint qualifications such as Mangasarian Fromovitz constraint
Mengwei Xu, Jane J. Ye
semanticscholar +1 more source
Constraint qualifications in input optimisation [PDF]
AbstractWe introduce assumptions in input optimisation that simplify the necessary conditions for an optimal input. These assumptions, in the context of nonlinear programming, give rise to conceptually new kinds of constraint qualifications.
van Rooyen, M., Sears, M., Zlobec, S.
openaire +2 more sources
In this paper, we consider a class of multiobjective mathematical programming problems with equilibrium constraints on Hadamard manifolds (in short, (MMPEC)).
Savin Treanţă +3 more
doaj +1 more source
A New Constraint Qualification and Sharp Optimality Conditions for Nonsmooth Mathematical Programming Problems in Terms of Quasidifferentials [PDF]
This paper is devoted to an analysis of optimality conditions for nonsmooth mathematical programming problems with equality and inequality constraints in terms of Demyanov-Rubinov-Polyakova quasidifferentials.
M. Dolgopolik
semanticscholar +1 more source
We take up a nonsmooth multiobjective optimization problem with tangentially convex objective and constraint functions. In employing a suitable constraint qualification, we formulate both necessary and sufficient optimality conditions for (local) quasi ...
Mohsine Jennane +3 more
doaj +1 more source
Optimality and Duality for DC Programming with DC Inequality and DC Equality Constraints
In this paper, a class of nondifferentiable DC programming with DC inequality and DC equality constraints are considered. Firstly, in terms of this special nondifferentiable DC constraint system, an appropriate relaxed constant rank constraint ...
Yingrang Xu, Shengjie Li
doaj +1 more source

