Results 31 to 40 of about 564,271 (287)
Optimality and Constraint Qualifications in Vector Optimization [PDF]
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 +1 more source
Stable Zero Lagrange Duality for DC Conic Programming
We consider the problems of minimizing a DC function under a cone-convex constraint and a set constraint. By using the infimal convolution of the conjugate functions, we present a new constraint qualification which completely characterizes the Farkas ...
D. H. Fang
doaj +1 more source
Two New Weak Constraint Qualifications and Applications [PDF]
We present two new constraint qualifications (CQs) that are weaker than the recently introduced relaxed constant positive linear dependence (RCPLD) CQ. RCPLD is based on the assumption that many subsets of the gradients of the active constraints preserve positive linear dependence locally.
Roberto Andreani +3 more
openaire +3 more sources
Characterizations of Stability of Error Bounds for Convex Inequality Constraint Systems
In this paper, we mainly study error bounds for a single convex inequality and semi-infinite convex constraint systems, and give characterizations of stability of error bounds via directional derivatives. For a single convex inequality, it is proved that
Wei, Zhou, Théra, Michel, Yao, Jen-Chih
doaj +1 more source
In this article, we investigate a class of non-smooth semidefinite multiobjective programming problems with inequality and equality constraints (in short, NSMPP). We establish the convex separation theorem for the space of symmetric matrices.
Balendu Bhooshan Upadhyay +2 more
doaj +1 more source
Abadie Type Constraint Qualifications and Optimality Conditions for Nonsmooth Multi-Objective Semi-Infinite Problems [PDF]
This paper introduces several Abadie-type constraint qualifications and derives necessary optimality conditions in the Karush-Kuhn-Tucker for both weakly efficient solutions and efficient solutions of a nonsmooth multi-objective semi-infinite programming
Ahmad Rezaee
doaj +1 more source
Characterizations of the basic constraint qualification and its applications
In convex programming, the basic constraint qualification is a necessary and sufficient constraint qualification for the optimality condition. In this paper, we give characterizations of the basic constraint qualification at each feasible solution.
YAMAMOTO, Shunsuke +2 more
core +1 more source
Effective compilation of constraint models [PDF]
Constraint Programming is a powerful technique for solving large-scale combinatorial (optimisation) problems. However, it is often inaccessible to users without expert knowledge in the area, precluding the wide-spread use of Constraint Programming ...
Rendl, Andrea
core +2 more sources
Referral Patterns and Diagnostic Timeliness in Pediatric Cancer: A Hospital‐Based Study in Indonesia
ABSTRACT Background Timely diagnosis and treatment are critical for improving survival among children with cancer. In low‐ and middle‐income countries (LMICs), delays are common and may be influenced by fragmented referral pathways and diagnostic limitations.
Nur Melani Sari +5 more
wiley +1 more source
Lagrange-type duality in DC programming problems with equivalent DC inequalities
In this paper, we provide Lagrange-type duality theorems for mathematical programming problems with DC objective and constraint functions. The class of problems to which Lagrange-type duality theorems can be applied is broader than the class in the ...
Ryohei Harada, Daishi Kuroiwa
doaj +1 more source

