Projection-based Reformulation and Decomposition Algorithm for A Class of Mixed-Integer Bilevel Linear Programs

Author(s):  
Dajun Yue ◽  
Fengqi You
2017 ◽  
Vol 65 (6) ◽  
pp. 1615-1637 ◽  
Author(s):  
Matteo Fischetti ◽  
Ivana Ljubić ◽  
Michele Monaci ◽  
Markus Sinnl

Author(s):  
Aly-Joy Ulusoy ◽  
Filippo Pecci ◽  
Ivan Stoianov

AbstractThis manuscript investigates the design-for-control (DfC) problem of minimizing pressure induced leakage and maximizing resilience in existing water distribution networks. The problem consists in simultaneously selecting locations for the installation of new valves and/or pipes, and optimizing valve control settings. This results in a challenging optimization problem belonging to the class of non-convex bi-objective mixed-integer non-linear programs (BOMINLP). In this manuscript, we propose and investigate a method to approximate the non-dominated set of the DfC problem with guarantees of global non-dominance. The BOMINLP is first scalarized using the method of $$\epsilon $$ ϵ -constraints. Feasible solutions with global optimality bounds are then computed for the resulting sequence of single-objective mixed-integer non-linear programs, using a tailored spatial branch-and-bound (sBB) method. In particular, we propose an equivalent reformulation of the non-linear resilience objective function to enable the computation of global optimality bounds. We show that our approach returns a set of potentially non-dominated solutions along with guarantees of their non-dominance in the form of a superset of the true non-dominated set of the BOMINLP. Finally, we evaluate the method on two case study networks and show that the tailored sBB method outperforms state-of-the-art global optimization solvers.


2014 ◽  
Vol 233 (3) ◽  
pp. 459-473 ◽  
Author(s):  
Xiaobo Li ◽  
Karthik Natarajan ◽  
Chung-Piaw Teo ◽  
Zhichao Zheng

Author(s):  
Milan Hladík

Traditionally, game theory problems were considered for exact data, and the decisions were based on known payoffs. However, this assumption is rarely true in practice. Uncertainty in measurements and imprecise information must be taken into account. The interval-based approach for handling such uncertainties assumes that one has lower and upper bounds on payoffs. In this paper, interval bimatrix games are studied. Especially, we focus on three kinds of support set invariancy. Support of a mixed strategy consists of that pure strategies having positive probabilities. Given an interval-valued bimatrix game and supports for both players, the question states as follows: Does every bimatrix game instance have an equilibrium with the prescribed support? The other two kinds of invariancies are slight modifications: Has every bimatrix game instance an equilibrium being a subset/superset of the prescribed support? It is computationally difficult to answer these questions: the first case costs solving a large number of linear programs or mixed integer programs. For the remaining two cases a sufficient condition and a necessary condition are proposed, respectively.


1999 ◽  
Vol 119 (3) ◽  
pp. 671-677
Author(s):  
Gilbert Laporte ◽  
Frédéric Semet

Transport ◽  
2014 ◽  
Vol 29 (3) ◽  
pp. 248-259 ◽  
Author(s):  
Lihui Zhang ◽  
Huiyuan Liu ◽  
Daniel (Jian) Sun

This paper analyses both the cordon and area pricings from the perspective of travel demand management. Sensitivity analysis of various performance measures with respect to the toll rate and demand elastic parameter is performed on a virtual grid network. The analysis shows that cordon pricing mainly affects those trips with origins outside of the Central Business District and destinations inside, while area pricing imposes additional cost on the trips with either origins or destinations in the Central Business District. Though both pricing strategies are able to alleviate traffic congestion in the charging area, area pricing seems more effective, however, area pricing owns the risk to detour too much traffic and thus cause severe congestion to the network outside of the Central Business District. Following the sensitivity analysis, a unified framework is proposed to optimize the designs of the both pricing strategies, which is flexible to account for various practical concerns. The optimization models are formulated as mixed-integer nonlinear programs with complementarity constraints, and the solution procedure is composed of solving a series of nonlinear programs and mixed-integer linear programs. Results from the numerical examples are in line with the findings in the sensitivity analysis. Under the specific network settings, cordon pricing achieves the best system performance when the toll rate reaches the maximum allowed, while area pricing finds the optimal design scheme when the toll rate equals half of the maximum allowed.


Sign in / Sign up

Export Citation Format

Share Document