Results 201 to 210 of about 2,261 (257)

Constraint Qualifications Revisited

Management Science, 1972
In this study we investigate the constraint qualifications for the Kuhn-Tucker conditions to hold for an inequality-constrained nonlinear programming problem. We present the qualifications in a consistent manner so that the interrelationships between them are highlighted. This gives rise naturally to two types of constraint qualifications, and it will
M. S. Bazaraa, J. J. Goode, C. M. Shetty
openaire   +2 more sources

Constraint qualifications in maximization problems

Naval Research Logistics Quarterly, 1961
AbstractMany problems arising in logistics and in the application of mathematics to industrial planning are in the form of constrained maximizations with nonlinear maximands or constraint functions or both. Thus a depot facing random demands for several items may wish to place orders for each in such a way as to maximize the expected number of demands ...
Arrow, K. J., Hurwicz, L., Uzawa, Hirofumi   +2 more
openaire   +2 more sources

Constraint qualifications in the invex case

Journal of Information and Optimization Sciences, 1998
Abstract The purposes of the present paper are: (1) to weaken certain constraint qualifications (CQ’s) for a nonlinear programming problem by means of invexity; (2) to study the relationships among the various CQ’s in the case of a closed set constraint; (3) to give a sufficient condition for the equivalence between the Kuhn-Tucker CQ and the Abadie CQ.
GIORGI G., GUERRAGGIO, ANGELO
openaire   +2 more sources

Constraint Qualifications for Nonsmooth Mathematical Programs with Equilibrium Constraints

Set-Valued and Variational Analysis, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Movahedian, N., Nobakhtian, S.
openaire   +2 more sources

On constraint qualifications

Journal of Optimization Theory and Applications, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Constraint qualifications for nonsmooth programming

Optimization, 2018
ABSTRACTBy using an implicit function theorem and a result of error bound, we provide new constraint qualifications ensuring the Karush–Kuhn–Tuker necessary optimality conditions for both smooth and nonsmooth optimization problems in normed spaces or Banach spaces.
Liren Huang, Lulin Tan, Chunguang Liu
openaire   +1 more source

Constraint qualifications in quasidifferentiable optimization

Mathematical Programming, 1993
The paper is devoted to inequality-constrained optimization problems with quasi-differentiable data, for which a qualification is said to hold if the null vector is a solution of the ``quasilinearized'' problem. The main result is that five qualification conditions can be ordered in such a way that each of them implies the one that follows.
Kuntz, Ludwig, Scholtes, Stefan
openaire   +2 more sources

Abadie-Type Constraint Qualification for Mathematical Programs with Equilibrium Constraints

Journal of Optimization Theory and Applications, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Flegel, M. L., Kanzow, C.
openaire   +2 more sources

Second-Order Enhanced Optimality Conditions and Constraint Qualifications

Journal of Optimization Theory and Applications, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kuang Bai, Yixia Song, Jin Zhang
openaire   +2 more sources

Avoiding a Constraint Qualification

Optimization, 1997
Necessary conditions are given for a constrained minimum, which do not assume any constraint qualification. The conditions relate to a cone, depending on constraint gradients at points near the minimum. They generalize a sufficient condition due to Hanson Under an invexity hypothesis.
openaire   +1 more source