Algorithms for solving the mixed integer two-level linear programming problem

doi:10.1016/0305-0548(90)90037-8

Computers & Operations Research

Volume 17, Issue 2, 1990, Pages 133-142

https://doi.org/10.1016/0305-0548(90)90037-8 Get rights and content

Abstract

Several algorithms have been developed to solve the two-level linear programming problem during the past years. In this paper, we will formulate the mixed integer two-level linear programming problem and develop both the exact and heuristic solution procedures based on the branch-and-bound technique for solving the problem. Computational experience and comparisons will be presented.

References (12)

J.F. Bard et al.
An explicit solution to the multi-level programming problem
Computers Opns Res.
(1982)
W.V. Candler et al.
A linear two-level programming problem
Computers Opns Res.
(1982)
G.A. Kochenberger et al.
A simple, all primal branch and bound approach to pure and mixed integer binary programs
Opns Res. Lett.
(1982)
R.K. Martin et al.
The reduced cost branch and bound algorithm for mixed integer programming
Computers Opns Res.
(1985)
G.E. Fox et al.
A simple strategy for solving a class of 0–1 integer programming models
Computers Opns Res.
(1986)
G.W. Evans
An overview of techniques for solving multiobjective mathematical programs
Mgmt Sci.
(1984)

There are more references available in the full text version of this article.

Cited by (87)

Angels against demons: Fight against smuggling in an illicit supply chain with uncertain outcomes and unknown structure
2023, Computers and Industrial Engineering
Illegal smuggling is one of the main concerns in many countries due to its significant negative economic and societal impacts. To control the problem, law enforcement officials work to prevent illegal smuggling operations. However, these officials usually encounter a multi-commodity network with an unidentified structure where traffickers trade illicit commodities at different levels. Therefore, they should manage their resources to prioritize identifying the network members, monitoring the identified members, and arresting them to remove their corresponding illegal trades from the network. To manage these operations, this study aims to utilize a mathematical approach, including a formulation and solution method, to manage the available resources in the network and minimize the illicit flows between the origins and destinations. The proposed approach considers real-world conditions, including multi-commodity flows and operations uncertainty. In other words, we investigate a multi-commodity maximum flow network interdiction problem with uncertain outcomes and an unknown network structure. The network under investigation denotes the relationships among criminals who trade illegal commodities in the distribution network. Given the complexity of the problem, this study contributes to the literature by developing a bi-level mixed-integer programming formulation to interdict maximum flow in a multi-commodity, multi-source relationship network considering uncertain outcomes of leader’s attacks. In addition, it develops a solution procedure based on the Benders decomposition algorithm to solve the developed formulation. Finally, to show the practicality of the developed formulation and solution method in real-world problems and to demonstrate their performance, we conduct a simulation analysis to determine how considering uncertainty affects the decisions. Our obtained results reveal that although considering the outcome uncertainty increases the solution time, it also increases the number of arrested criminals by about 29% on average and decreases the volume of trafficking by up to 14%.
Nonlinear optimization in bi-level selective maintenance allocation problem
2022, Journal of King Saud University - Science
Citation Excerpt :
Sakawa et al. (2002) formulated decentralized BLPP using an interactive fuzzy programming approach. Similarly, Wen et al. (1990) formulated BLPP in which the yes or no high-level decision-makers control combined with the real-valued lower-level decision control as a mixed-integer programming problem. The study provides both exact and heuristics algorithms for solving such models.
The structural diversity of systems and the resource limitations, and the need to improve system reliability give birth to several optimization techniques and analyses. Recently, the significance of reliability and maintainability concepts has been increasing attention. Several optimization concepts exist in the reliability literature. However, less concern has been given to the bi-level programming concept, especially in the selective maintenance allocation problem. Hence, the present study is motivated and focuses on bridging the existing literature gap. This paper aims to transform a problem of reliability into a Bi-Level Programming Problem (BLPP). The objective functions are non-linear, and the constraints are linear. The current paper demonstrates the reliability optimization problem as a BLPP and applies the Kuhn-Tucker approach to solving the formulated BLPP. A section for estimating the reliability parameters are discussed, and a numerical example has been provided to illustrate the solution procedure.
Bi-level mixed-integer linear programming algorithm for evaluating the impact of load-redistribution attacks on Volt-VAR optimization in high- and medium-voltage distribution systems
2021, International Journal of Electrical Power and Energy Systems
Citation Excerpt :
However, the analysis and solutions were not very convincing because the optimality of lower-level MILP problems could not be ensured owing to the relaxation. Most BMILP algorithms can only solve special classes of BMILP, such as integer bi-level linear programming [22], BMILPs without continuous upper-level variables [23,24], and BMILPs without continuous lower-level variables [25,26]. Fischetti et al. [27] introduced a general-purpose algorithm for solving BMILPs based on a branch-and-cut framework.
The increasing integration of distributed generators into distribution systems (DSs) poses significant challenges to the stable operation and cyber-physical security of integrated high- and medium-voltage distribution system (HMVDS), leaving Volt-VAR optimization (VVO) vulnerable to load-redistribution attacks. This study focused on VVO in an HMVDS subject to the load-redistribution attack. The VVO under load-redistribution attack was formulated as a single-leader-multi-follower bi-level mixed-integer linear programming (BMILP) model that captured the interaction between the attacker and DS operators. The attacker in the upper level aimed to maximize voltage deviations and load curtailment through load-redistribution attack, while the DS operators aimed to minimize the voltage deviations in the lower levels. A relaxation-based bi-level reformulation and decomposition algorithm was designed to solve the BMILP model through replacing each mixed-integer linear programming lower-level problem with multiple linear programming lower-level problems, and using nonnegative relaxation variables and penalty functions to ensure equivalence. Finally, case studies on a constructed HMVDS and a real-world HMVDS were conducted to illustrate the impact of load-redistribution attacks on VVO and verify the effectiveness of the proposed methods.
Dynamic interdiction networks with applications in illicit supply chains
2020, Omega (United Kingdom)
We study the interdiction of illegal product distribution in a network with multiple sources (origins) and sinks (destinations). This work contributes to the literature of dynamic maximum flow interdiction problems by addressing multiple commodities in a network of relationships. The related distribution network consists of (1) criminals, who are hierarchically connected, and seeking to maximize the total profit flow from origins to destinations, and (2) enforcement officers aiming to minimize criminals’ long-term success by monitoring and arresting them, using the limited resources at their disposal. Considering several real-world operational details, we first propose a mixed-integer programming model by reformulating a Min–Max bi-level mathematical model. We then propose a new formulation and discuss its efficiency compared with the traditional duality-based reformulation. This new formulation also has a higher compatibility with decomposition solution methods. Utilizing the new formulation, we design a solution method based on the Benders decomposition procedure and apply several accelerating strategies (e.g., Super Valid Inequalities) to solve larger instances for a better representation of reality. Lastly, we create a heuristic method based on real-world evidence, which is usually practiced by law enforcement officers. Our results show that the quality of the heuristic method declines quickly as the network size increases.
Road network pricing and design for ordinary and hazmat vehicles: Integrated model and specialized local search
2019, Computers and Operations Research
Citation Excerpt :
By contrast, when the population size in the neighborhood of the toll-free road is equal to 10, the operator charges 16.8 monetary units for traveling through that new road. Single level reformulations (SLRs) are one of the most used techniques for solving these class of problems (see, for instance, (Dempe, 2002; Dempe and Dutta, 2012; Dempe et al., 2015; Garcia-Herreros et al., 2016; Wen and Yang, 1990; Zare et al., 2017) for a theoretical and practical background of this type of reformulations). The SLRs require to determine the optimality conditions of the lower level problem, and to append them to the upper level problem.
In the context of vehicle transportation in congested roads, we propose an optimization framework to integrate the operator decisions on network pricing, regulation, and expansion, while accounting for the shipments of hazardous materials. Current research trends only provide partial modeling integrations of the well-known toll optimization, hazmat transportation, and network design problems. However, the growing complexity of traffic management requires a stronger coordination in the operator decisions. In this paper, a mixed-integer non-linear bi-level problem is introduced to model this integration. The model considers a road network operator (acting as a leader), who maximizes its profit –the toll income minus the costs from roads construction and risk exposure to hazmat transportation–, and vehicles (acting as a follower), who minimize their travel costs –due to traffic congestion and toll charges. We introduce a reformulation approach that approximates this complex integrated problem with arbitrary precision and apply a specialized local search to exploit the structure of such reformulation. This combined resolution strategy relies upon a binary-search-based procedure, which sequentially updates the road prices intervals in such a way that the operator profit is monotonically improved. The effectiveness of the proposed approach is shown on a variety of structural configurations and economic settings, involving 1620 instances tested on the well-known Sioux Falls road network.
A Multi-Parametric optimization approach for bilevel mixed-integer linear and quadratic programming problems
2019, Computers and Chemical Engineering
Optimization problems involving two decision makers at two different decision levels are referred to as bi-level programming problems. In this work, we present novel algorithms for the exact and global solution of two classes of bi-level programming problems, namely (i) bi-level mixed-integer linear programming problems (B-MILP) and (ii) bi-level mixed-integer convex quadratic programming problems (B-MIQP) containing both integer and bounded continuous variables at both optimization levels. Based on multi-parametric programming theory, the main idea is to recast the lower level problem as a multi-parametric programming problem, in which the optimization variables of the upper level problem are considered as bounded parameters for the lower level. The resulting exact multi-parametric mixed-integer linear or quadratic solutions are then substituted into the upper level problem, which can be solved as a set of single-level, independent, deterministic mixed-integer optimization problems. Extensions to problems including right-hand-side uncertainty on both lower and upper levels are also discussed. Finally, computational implementation and studies are presented through test problems.

View all citing articles on Scopus

^†: U.P. Wen is Associate Professor of Industrial Engineering, National Tsing Hua University, Hsinchu, Taiwan, R.O.C. He received his PhD in industrial engineering from State University of New York at Buffalo. His primary research interests are in the area of multicriteria decision making, automatic warehousing systems and applied operations research. Dr Wen is currently a Visiting Scholar at the University of Maryland (1989–1990).

View full text

Algorithms for solving the mixed integer two-level linear programming problem

Abstract

Computers Opns Res.

Computers Opns Res.

Opns Res. Lett.

Computers Opns Res.

Computers Opns Res.

An overview of techniques for solving multiobjective mathematical programs

Mgmt Sci.