Bilevel Programming and Applications

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

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Variational Analysis of Marginal Functions with Applications to Bilevel Programming

This paper pursues a twofold goal. First to derive new results on generalized differentiation in variational analysis focusing mainly on a broad class of intrinsically nondifferentiable marginal/value functions. Then the results established in this direction apply to deriving necessary optimality conditions for the optimistic version of bilevel programs that occupy a remarkable place in optimiz...

متن کامل

BILEVEL LINEAR PROGRAMMING WITH FUZZY PARAMETERS

Bilevel linear programming  is a decision making problem with a two-level decentralized organization. The textquotedblleft leadertextquotedblright~ is in the upper level and the textquotedblleft followertextquotedblright, in the lower. Making a decision at one level affects that at the other one. In this paper, bilevel linear programming  with inexact parameters has been studied and a method is...

متن کامل

Bilevel Programming - a Survey

Bilevel programming problems are hierarchical optimization problems where an objective function is to be minimized over the graph of the solution set mapping of a second parametric optimization problem. It is the aim of the paper to give a survey for this living research area indicating main recent approaches to solve such problems and to describe optimality conditions as well as to touch main ...

متن کامل

Bilevel programming: A survey

This paper provides an introductory survey of a class of optimization problems known as bilevel programming. We motivate this class through a simple application, and then proceed with the general formulation of bilevel programs. We consider various cases (linear, linear-quadratic, nonlinear), describe their main properties and give an overview of solution approaches.

متن کامل

Bilevel Programming with Knapsack Constraints

A special class of bilevel programming problems with discrete para-metric lower level problems is considered. First, necessary and suucient conditions for the existence of optimal solutions are given. Then, a pseu-dopolynomial exact and a polynomial approximate algorithms for solving the bilevel problem are proposed.

متن کامل

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


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

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2015

ISSN: 1024-123X,1563-5147

DOI: 10.1155/2015/310301