650 research outputs found
Solving ill-posed bilevel programs
This paper deals with ill-posed bilevel programs, i.e., problems admitting multiple lower-level solutions for some upper-level parameters. Many publications have been devoted to the standard optimistic case of this problem, where the difficulty is essentially moved from the objective function to the feasible set. This new problem is simpler but there is no guaranty to obtain local optimal solutions for the original optimistic problem by this process. Considering the intrinsic non-convexity of bilevel programs, computing local optimal solutions is the best one can hope to get in most cases. To achieve this goal, we start by establishing an equivalence between the original optimistic problem an a certain set-valued optimization problem. Next, we develop optimality conditions for the latter problem and show that they generalize all the results currently known in the literature on optimistic bilevel optimization. Our approach is then extended to multiobjective bilevel optimization, and completely new results are derived for problems with vector-valued upper- and lower-level objective functions. Numerical implementations of the results of this paper are provided on some examples, in order to demonstrate how the original optimistic problem can be solved in practice, by means of a special set-valued optimization problem
Necessary Conditions in Multiobjective Optimization With Equilibrium Constraints
In this paper we study multiobjective optimization problems with equilibrium constraints (MOECs) described by generalized equations in the form 0 is an element of the set G(x,y) + Q(x,y), where both mappings G and Q are set-valued. Such models particularly arise from certain optimization-related problems governed by variational inequalities and first-order optimality conditions in nondifferentiable programming. We establish verifiable necessary conditions for the general problems under consideration and for their important specifications using modern tools of variational analysis and generalized differentiation. The application of the obtained necessary optimality conditions is illustrated by a numerical example from bilevel programming with convex while nondifferentiable data
Solving a type of biobjective bilevel programming problem using NSGA-II
AbstractThis paper considers a type of biobjective bilevel programming problem, which is derived from a single objective bilevel programming problem via lifting the objective function at the lower level up to the upper level. The efficient solutions to such a model can be considered as candidates for the after optimization bargaining between the decision-makers at both levels who retain the original bilevel decision-making structure. We use a popular multiobjective evolutionary algorithm, NSGA-II, to solve this type of problem. The algorithm is tested on some small-dimensional benchmark problems from the literature. Computational results show that the NSGA-II algorithm is capable of solving the problems efficiently and effectively. Hence, it provides a promising visualization tool to help the decision-makers find the best trade-off in bargaining
Notes on the value function approach to multiobjective bilevel optimization
This paper is concerned with the value function approach to multiobjective
bilevel optimization which exploits a lower level frontier-type mapping in
order to replace the hierarchical model of two interdependent multiobjective
optimization problems by a single-level multiobjective optimization problem. As
a starting point, different value-function-type reformulations are suggested
and their relations are discussed. Here, we focus on the situations where the
lower level problem is solved up to efficiency or weak efficiency, and an
intermediate solution concept is suggested as well. We study the
graph-closedness of the associated efficiency-type and frontier-type mappings.
These findings are then used for two purposes. First, we investigate existence
results in multiobjective bilevel optimization. Second, for the derivation of
necessary optimality conditions via the value function approach, it is inherent
to differentiate frontier-type mappings in a generalized way. Here, we are
concerned with the computation of upper coderivative estimates for the
frontier-type mapping associated with the setting where the lower level problem
is solved up to weak efficiency. We proceed in two ways, relying, on the one
hand, on a weak domination property and, on the other hand, on a scalarization
approach. Throughout the paper, illustrative examples visualize our findings,
the necessity of crucial assumptions, and some flaws in the related literature.Comment: 30 page
Quality Representation in Multiobjective Programming
In recent years, emphasis has been placed on generating quality representations of the nondominated set of multiobjective programming problems. This manuscript presents two methods for generating discrete representations with equidistant points for multiobjective programs with solution sets determined by convex cones. The Bilevel Controlled Spacing (BCS) method has a bilevel structure with the lower-level generating the nondominated points and the upper-level controlling the spacing. The Constraint Controlled Spacing (CCS) method is based on the epsilon-constraint method with an additional constraint to control the spacing of generated points. Both methods (under certain assumptions) are proven to produce (weakly) nondominated points. Along the way, several interesting results about obtuse, simplicial cones are also proved. Both the BCS and CCS methods are tested and show promise on a variety of problems: linear, convex, nonconvex (CCS only), two-dimensional, and three-dimensional. Sample Matlab code for two of these examples can be found in the appendices as well as tables containing the generated solution points. The manuscript closes with conclusions and ideas for further research in this field
- …