Showing 1 - 10 of 16
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...
Persistent link: https://www.econbiz.de/10010896526
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...
Persistent link: https://www.econbiz.de/10010845837
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...
Persistent link: https://www.econbiz.de/10010999960
In this paper, we consider minimization problems with a quasiconvex vector-valued inequality constraint. We propose two constraint qualifications, the closed cone constraint qualification for vector-valued quasiconvex programming (the VQ-CCCQ) and the basic constraint qualification for...
Persistent link: https://www.econbiz.de/10010994056
Persistent link: https://www.econbiz.de/10010994115
Persistent link: https://www.econbiz.de/10008502505
Persistent link: https://www.econbiz.de/10008925258
This paper aims to study a broad class of generalized semi-infinite programming problems with (upper and lower level) objectives given as the difference of two convex functions, and (lower level) constraints described by a finite number of convex inequalities and a set constraints. First, we are...
Persistent link: https://www.econbiz.de/10010680604
The elegant theoretical results for strong duality and strict complementarity for linear programming, LP, lie behind the success of current algorithms. In addition, preprocessing is an essential step for efficiency in both simplex type and interior-point methods. However, the theory and...
Persistent link: https://www.econbiz.de/10010600749
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...
Persistent link: https://www.econbiz.de/10010759553