Results 11 to 20 of about 2,669 (290)

ON THE PROBLEMS OF BILEVEL OPTIMIZATION UNDER RCPLD CONSTRAINT QUALIFICATIONS [PDF]

open access: greenДоклады Белорусского государственного университета информатики и радиоэлектроники, 2019
Multilevel optimization problems often arise in various applications (in economics, ecology, power engineering and other areas) when modeling complex systems with a hierarchical structure associated with independent actions of subsystems.
L. I. Minchenko, S. I. Sirotko
doaj   +6 more sources

CONSTRAINT QUALIFICATIONS IN PARTIAL IDENTIFICATION [PDF]

open access: greenEconometric 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
  +7 more sources

On constraint qualifications in mathematical programming

open access: greenДоклады Белорусского государственного университета информатики и радиоэлектроники, 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   +2 more sources

Relations between Abs-Normal NLPs and MPCCs. Part 2: Weak Constraint Qualifications [PDF]

open access: diamondJournal of Nonsmooth Analysis and Optimization, 2021
This work continues an ongoing effort to compare non-smooth optimization problems in abs-normal form to Mathematical Programs with Complementarity Constraints (MPCCs).
Lisa C. Hegerhorst-Schultchen   +2 more
doaj   +3 more sources

Constraint Qualifications for Vector Optimization Problems in Real Topological Spaces [PDF]

open access: greenAxioms, 2023
In this paper, we introduce a series of definitions of generalized affine functions for vector-valued functions by use of “linear set”. We prove that our generalized affine functions have some similar properties to generalized convex functions.
Renying Zeng
doaj   +4 more sources

Constraint Qualifications and Optimality Criteria for Nonsmooth Multiobjective Mathematical Programming Problems with Equilibrium Constraints on Hadamard Manifolds [PDF]

open access: goldAxioms
Nonsmooth multiobjective mathematical programming problems with equilibrium constraints (NMMPEC) are studied in this article in the Hadamard manifold setting.
B. B. Upadhyay   +3 more
doaj   +4 more sources

On Constraint qualifications of a nonconvex inequality [PDF]

open access: greenOptimization 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

On constant rank-type constraint qualifications for second order cone programs in two-dimensional spaces

open access: diamondTạp chí Khoa học, 2023
In this paper, we study the relationship between the constant ranktype constraint qualifications for nonlinear second-order cone programs, which was recently developed by R. Andreani et al. ([2], [3]) in two-dimensional space.
Le Van Hien
doaj   +2 more sources

Sufficiency and Duality for Interval-Valued Optimization Problems with Vanishing Constraints Using Weak Constraint Qualifications

open access: goldInternational Journal of Analysis and Applications, 2020
In this paper, we are concerned with one of the difficult class of optimization problems called the interval-valued optimization problem with vanishing constraints.
Izhar Ahmad   +2 more
doaj   +3 more sources

Constraint qualifications in input optimisation [PDF]

open access: bronzeThe 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   +3 more sources

Home - About - Disclaimer - Privacy