ON THE PROBLEMS OF BILEVEL OPTIMIZATION UNDER RCPLD CONSTRAINT QUALIFICATIONS

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constraint Qualifications and KKT Conditions for Bilevel Programming Problems

In this paper we consider the bilevel programming problem (BLPP), which is a sequence of two optimization problems where the constraint region of the upper-level problem is determined implicitly by the solution set to the lower-level problem. We extend well-known constraint qualifications for nonlinear programming problems such as the Abadie constraint qualification, the Kuhn-Tucker constraint ...

متن کامل

On constraint qualifications in directionally differentiable multiobjective optimization problems

We consider a multiobjective optimization problem with a feasible set defined by inequality and equality constraints such that all functions are, at least, Dini differentiable (in some cases, Hadamard differentiable and sometimes, quasiconvex). Several constraint qualifications are given in such a way that generalize both the qualifications introduced by Maeda and the classical ones, when the f...

متن کامل

The bilevel programming problem: reformulations, constraint qualifications and optimality conditions

We consider the bilevel programming problem and its optimal value and KKT one level reformulations. The two reformulations are studied in a unified manner and compared in terms of optimal solutions, constraint qualifications and optimality conditions. We also show that any bilevel programming problem where the lower level problem is linear with respect to the lower level variable, is partially ...

متن کامل

Newton-Type Methods for Optimization Problems without Constraint Qualifications

We consider equality-constrained optimization problems, where a given solution may not satisfy any constraint qualification but satisfies the standard second-order sufficient condition for optimality. Based on local identification of the rank of the constraints degeneracy via the singular-value decomposition, we derive a modified primal-dual optimality system whose solution is locally unique, n...

متن کامل

Necessary optimality conditions for constrained optimization problems under relaxed constraint qualifications

We derive firstand second-order necessary optimality conditions for set-constrained optimization problems under the constraint qualificationtype conditions significantly weaker than Robinson’s constraint qualification. Our development relies on the so-called 2-regularity concept, and unifies and extends the previous studies based on this concept. Specifically, in our setting constraints are giv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Doklady BGUIR

سال: 2019

ISSN: 1729-7648

DOI: 10.35596/1729-7648-2019-126-8-86-92