TITLE

Bilevel optimization: on the structure of the feasible set

AUTHOR(S)
Jongen, H.; Shikhman, V.
PUB. DATE
November 2012
SOURCE
Mathematical Programming;Nov2012, Vol. 136 Issue 1, p65
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
We consider bilevel optimization from the optimistic point of view. Let the pair ( x, y) denote the variables. The main difficulty in studying such problems lies in the fact that the lower level contains a global constraint. In fact, a point ( x, y) is feasible if y solves a parametric optimization problem L( x). In this paper we restrict ourselves to the special case that the variable x is one-dimensional. We describe the generic structure of the feasible set M. Moreover, we discuss local reductions of the bilevel problem as well as corresponding optimality criteria. Finally, we point out typical problems that appear when trying to extend the ideas to higher dimensional x-dimensions. This will clarify the high intrinsic complexity of the general generic structure of the feasible set M and corresponding optimality conditions for the bilevel problem U.
ACCESSION #
83596091

 

Related Articles

  • Problems with resource allocation constraints and optimization over the efficient set. Thach, P.; Thang, T. // Journal of Global Optimization;Mar2014, Vol. 58 Issue 3, p481 

    The paper studies a nonlinear optimization problem under resource allocation constraints. Using quasi-gradient duality it is shown that the feasible set of the problem is a singleton (in the case of a single resource) or the set of Pareto efficient solutions of an associated vector maximization...

  • Pointwise well-posedness and scalarization in set optimization. Khoshkhabar-amiranloo, S.; Khorram, E. // Mathematical Methods of Operations Research;Oct2015, Vol. 82 Issue 2, p195 

    In this paper, some notions of pointwise well-posedness for set optimization problems are introduced. Some relationships among these notions are established. Using a new nonlinear scalarization function, pointwise well-posed set optimization problems are characterized by means of a family of...

  • The bilevel programming problem: reformulations, constraint qualifications and optimality conditions. Dempe, S.; Zemkoho, A. // Mathematical Programming;Apr2013, Vol. 138 Issue 1/2, p447 

    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...

  • Measuring Project Complexity and Uncertainty: Scale Proposal. de Souza Pinto, Jefferson; Novaski, Olívio; Anholon, Rosley; Carpim Besteiro, Élen Nara // Business Management Dynamics;Jul2014, Vol. 4 Issue 1, p29 

    This work develops an instrument for evaluating projects - a range of numerical measurement in degrees - which includes a set of attributes of complexity and uncertainty variables in projects. Through theoretical foundations, we identified a set of variables that represent the attributes...

  • THE FUNDAMENTAL OPERATION ON CONNECTION NUMBER AND ITS APPLICATIONS. CHUNFENG LIU; LING ZHANG; AIMIN YANG // Journal of Theoretical & Applied Information Technology;3/20/2013, Vol. 49 Issue 2, p618 

    In this paper, we introduced the basic knowledge of set pair analysis at the first place. Then we defined the general form of basic operations and the properties of connection number, in the end we give the corresponding application examples. The concepts and methods of the operations are the...

  • Towards the global solution of the maximal correlation problem. Zhang, Lei-Hong; Liao, Li-Zhi; Sun, Li-Ming // Journal of Global Optimization;Jan2011, Vol. 49 Issue 1, p91 

    The maximal correlation problem (MCP) aiming at optimizing correlation between sets of variables plays a very important role in many areas of statistical applications. Currently, algorithms for the general MCP stop at solutions of the multivariate eigenvalue problem for a related matrix A, which...

  • Set Approach for Set Optimization with Variable Ordering Structures Part I: Set Relations and Relationship to Vector Approach. Eichfelder, Gabriele; Pilecka, Maria // Journal of Optimization Theory & Applications;Dec2016, Vol. 171 Issue 3, p931 

    This paper aims at combining variable ordering structures with set relations in set optimization, which have been defined using the constant ordering cone before. We provide several new set relations in the context of variable ordering structures, discuss their usefulness, and give different...

  • Variable Sparsity Kernel Learning. Aflalo, Jonathan; Ben-Tal, Aharon; Bhattacharyya, Chiranjib; Nath, Jagarlapudi Saketha; Raman, Sankaran; Sonnenburg, Soeren // Journal of Machine Learning Research;Feb2011, Vol. 12 Issue 2, p565 

    This paper presents novel algorithms and applications for a particular class of mixed-norm regularization based Multiple Kernel Learning (MKL) formulations. The formulations assume that the given kernels are grouped and employ l1 norm regularization for promoting sparsity within RKHS norms of...

  • Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic. Laforest, Christian; Phan, Raksmey // RAIRO -- Operations Research;Jul2013, Vol. 47 Issue 3, p199 

    In this paper we present a new approach to solve the Minimum Independent Dominating Set problem in general graphs which is one of the hardest optimization problem. We propose a method using a clique partition of the graph, partition that can be obtained greedily. We provide conditions under...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics