Results 11 to 20 of about 495,604 (291)
Optimality and Constraint Qualifications in Vector Optimization [PDF]
, 2010 We propose a unifying approach in deriving constraint qualifications and theorem of the alternative. We first introduce a separation theorem between a subspace and the non-positive orthant, and then we use it to derive a new constraint qualification for a smooth vector optimization problem with inequality constraints.
MARTEIN, LAURA, CAROSI, LAURA
openaire +2 more sources
Optimality Conditions and Constraint Qualifications for Quasiconvex Programming [PDF]
Journal of Optimization Theory and Applications, 2019 The minimization of upper semicontinuous quasiconvex functions \(f\) in a closed convex set is considered subject to nonpositivity of some lower semicontinuous quasiconvex functions, each described by way of a generator, i.e. as the supremum of a family of quasiaffine functions. For essentially quasiconvex \(f\) (i.e. having no local non-global minima)
Suzuki, Satoshi
openaire +2 more sources
MathematicsIn this paper, we investigate constraint qualifications and optimality conditions for multiobjective mathematical programming problems with vanishing constraints (MOMPVC) on Hadamard manifolds.
Balendu Bhooshan Upadhyay +3 more
doaj +2 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
Tạ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 +1 more source
Fractal and Fractional, 2021 In this paper, we establish Fritz John stationary conditions for nonsmooth, nonlinear, semidefinite, multiobjective programs with vanishing constraints in terms of convexificator and introduce generalized Cottle type and generalized Guignard type ...
Kin Keung Lai +4 more
doaj +1 more source
On duality for nonsmooth Lipschitz optimization problems [PDF]
Yugoslav Journal of Operations Research, 2009 We present some duality theorems for a non-smooth Lipschitz vector optimization problem. Under generalized invexity assumptions on the functions the duality theorems do not require constraint qualifications.
Preda Vasile +2 more
doaj +1 more source
Mathematics, 2021 In this paper, we consider a class of mathematical programs with switching constraints (MPSCs) where the objective involves a non-Lipschitz term. Due to the non-Lipschitz continuity of the objective function, the existing constraint qualifications for ...
Jinman Lv, Zhenhua Peng, Zhongping Wan
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
Residential child care qualifications audit 2007 [PDF]
, 2007 In recent years there has been a drive to develop a fully qualified residential child care sector in Scotland. In 2003 the Scottish Social Services Council (SSSC) announced the baseline qualifications for residential child care staff and set down a ...
Hunter, Lynne +4 more
core +4 more sources