Results 11 to 20 of about 564,271 (287)
Constraint qualification failure in action [PDF]
Operations Research Letters, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hassan L. Hijazi, Leo Liberti
openaire +4 more sources
Duality without constraint qualification in nonsmooth optimization [PDF]
International Journal of Mathematics and Mathematical Sciences, 2006 We are concerned with a nonsmooth multiobjective optimization problem with inequality constraints. In order to obtain our main results, we give the definitions of the generalized convex functions based on the generalized directional derivative. Under the
S. Nobakhtian
doaj +3 more sources
RELAXED MANGASARIAN-FROMOVITZ CONSTRAINT QUALIFICATION AND ITS APPLICATIONS
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019 Nonlinear programming problems are considered under the relaxed Mangasarian-Fromovitz constraint qualification. It was established that a new constraint qualification CRSC is another form of relaxed Mangasarian-Fromovitz constraint qualification and ...
S. V. Aktanarovich +3 more
doaj +1 more source
Necessary and Sufficient Constraint Qualification for Surrogate Duality
Journal of Optimization Theory and Applications, 2011 The authors investigate necessary and sufficient constraint qualifications for surrogate duality closely related with ones for Lagrange-type dualities, in comparison with such as these conditions in the usual mathematical programming. Reviewer's remark: This paper is also important for proper numerical studies.
Satoshi Suzuki, Daishi Kuroiwa
core +5 more sources
CONSTRAINT QUALIFICATIONS IN PARTIAL IDENTIFICATION [PDF]
Econometric Theory, 2021 The literature on stochastic programming typically restricts attention to problems that fulfill constraint qualifications. The literature on estimation and inference under partial identification frequently restricts the geometry of identified sets with diverse high-level assumptions.
Kaido, Hiroaki +2 more
openaire +3 more sources
The Lagrangian, constraint qualifications and economics
Mathematical Methods of Operations Research, 2022 AbstractConsidering constrained choice, practitioners and theorists frequently invoke a Lagrangian to generate optimality conditions. Regular use of that vehicle requires, however, some constraintqualification. Yet many economists go easy on the mathematics of that issue. Conversely, few mathematicians elaborate on the economics of the context. Thereby
Sjur Didrik Flåm, Jan-J. Rückmann
openaire +3 more sources
On constraint qualifications in mathematical programming
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019 The article is devoted to the condition of R-regularity (Error Bound Property) in problems of mathematical programming. This condition plays an important role in analyzing the convergence of numerical optimization algorithms and it is a fairly general ...
L. I. Minchenko, S. I. Sirotko
doaj +1 more source
Constraint qualifications in input optimisation [PDF]
The Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1989 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
On Constraint qualifications of a nonconvex inequality
Optimization Letters, 2017 In this paper, we study constraint qualifications for the nonconvex inequality defined by a proper lower semicontinuous function. These constraint qualifications involve the generalized construction of normal cones and subdifferentials. Several conditions for these constraint qualifications are also provided therein.
Zhou Wei, Jen-Chih Yao
openaire +4 more sources
Saddle point criteria for semidefinite semi-infinite convex multiobjective optimization problems [PDF]
Yugoslav Journal of Operations Research, 2022 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