Results 231 to 240 of about 564,271 (287)

Research on Live Working Robots for 10 KV Distribution Networks Adopting Four-Dimensional Safety Guarantee Framework. [PDF]

Sensors (Basel)
Xie X, Sun L, Luo P, Yin X.
europepmc   +1 more source

Optimizing university course timetabling for metaverse integration: a human-centered decision model in medical education. [PDF]

BMC Med Educ
Damar S, Koksalmis GH.
europepmc   +1 more source

On relaxing the Mangasarian–Fromovitz constraint qualification [PDF]

Positivity, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander Kruger, Leonid I Minchenko, Jiří V Outrata   +2 more
exaly   +5 more sources

On Set Containment Characterization and Constraint Qualification for Quasiconvex Programming

Journal of Optimization Theory and Applications, 2011
Dual characterizations of the containment of a convex set with qua-siconvex inequality constraints are investigated. A new Lagrange-type duality and a new closed cone constraint qualification are described, and it is shown that this constraint ...
Daishi Kuroiwa
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

On constraint qualifications

Journal of Optimization Theory and Applications, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wolfgang Achtziger, Christian Kanzow
openaire   +5 more sources

A relaxed constant positive linear dependence constraint qualification and applications [PDF]

Mathematical Programming, 2011
In this work we introduce a relaxed version of the constant positive linear dependence constraint qualification (CPLD) that we call RCPLD. This development is inspired by a recent generalization of the constant rank constraint qualification by Minchenko ...
Gabriel Haeser, Paulo J. S. Silva, Roberto Andreani   +2 more
exaly   +3 more sources

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 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 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.
Ludwig Kuntz, Stefan Scholtes
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