Abstract
Linear mixed 0–1 integer programming problems may be reformulated as equivalent continuous bilevel linear programming (BLP) problems. We exploit these equivalences to transpose the concept of mixed 0–1 Gomory cuts to BLP. The first phase of our new algorithm generates Gomory-like cuts. The second phase consists of a branch-and-bound procedure to ensure finite termination with a global optimal solution. Different features of the algorithm, in particular, the cut selection and branching criteria are studied in details. We propose also a set of algorithmic tests and procedures to improve the method. Finally, we illustrate the performance through numerical experiments. Our algorithm outperforms pure branch-and-bound when tested on a series of randomly generated problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Van Stackelberg, H.: The Theory of Market Economy. Oxford University Press, Oxford (1952)
Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)
Loridan, P., Morgan, J.: ε-Regularized two-level optimization problems: approximation and existence results. In: Fifth French-German Conference on Optimization. Lecture Notes in Mathematics, vol. 1405, pp. 99–113. Springer, Berlin (1989)
Jeroslow, R.: The polynomial hierarchy and a simple model for competitive analysis. Math. Program. 32, 146–164 (1985)
Hansen, P., Jaumard, B., Savard, G.: New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 13, 1194–1217 (1992)
Vicente, L.N., Savard, G., Júdice, J.J.: Discrete linear bilevel programming problem. J. Optim. Theory Appl. 89, 597–614 (1996)
Outrata, J.V., Kocvara, M., Zowe, J.: Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer Academic, Dordrecht (1998)
Scholtes, S., Stohr, M.: Exact penalization of mathematical programs with equilibrium constraints. SIAM J. Control Optim. 37, 617–652 (1999)
Fukushima, M., Pang, J.S.: Complementarity constraint qualifications and simplified b-stationarity conditions for mathematical programs with equilibrium constraints. Comput. Optim. Appl. 13, 111–136 (1999)
Dussault, J.-P., Marcotte, P., Roch, S., Savard, G.: A smoothing heuristic for a class of bilinear bilevel programs. Cahier du GERAD, GERAD (2004)
Candler, W., Townsley, R.: A linear two-level programming problem. Comput. Oper. Res. 9, 59–76 (1982)
Bialas, W., Karwan, M.: Two-level linear programming. Manag. Sci. 30, 1004–1020 (1984)
Tuy, H., Migdalas, A., Värbrand, P.: A global optimization approach for the linear two-level program. J. Glob. Optim. 3, 1–23 (1993)
Bialas, W., Karwan, M., Shaw, J.: A parametric complementarity pivot approach for two-level linear programming. Operations Research Program Report 80-2, State University of New York at Buffalo (1980)
Júdice, J., Faustino, A.: A sequential LCP method for bilevel linear programming. Ann. Oper. Res. 34, 89–106 (1992)
Bard, J.F., Moore, J.: A branch-and-bound algorithm for the bilevel programming problem. SIAM J. Sci. Stat. Comp. 11, 281–292 (1990)
Tuy, H.: Concave programming under linear constraints. Sov. Math. 5, 1437–1440 (1964)
White, D., Anandalingam, G.: A penalty function approach for solving bilevel linear programs. J. Glob. Optim. 3, 397–419 (1993)
Marcotte, P., Shiquan, W., Chen, Y.: A cutting-plane algorithm for the linear bilevel programming problem. CRT Report 925 (1993)
Audet, C., Savard, G., Zghal, W.: New branch-and-cut algorithm for bilevel linear programming. GERAD Report G-2004-13, GERAD (2004)
Savard, G.: Contributions à la programmation mathématiques à deux niveaux. PhD Thesis, École Polytechnique de Montréal (1988)
Audet, C., Hansen, P., Jaumard, B., Savard, G.: Links between linear bilevel and mixed 0–1 programming problems. J. Optim. Theory Appl. 93, 273–300 (1997)
Fortuny-Amat, J., McCarl, B.: A representation and economic interpretation of a two-level programming problem. J. Oper. Res. Soc. 32, 783–792 (1981)
Beale, E.M.L., Small, R.E.: Mixed integer programming by a branch-and-bound technique. Proc. 3rd IFIP Congress 2, 450–451 (1965)
Gomory, R.: An algorithm for the mixed integer problem. Technical Report RM-2537, Rand Corporation (1960)
Nemhauser, G.L., Wolsey, L.A.: Integer Programming and Combinatorial Optimization. Wiley–Interscience, New York (1988)
Wolsey, L.A.: Integer Programming. Collection Wiley–Interscience Series in Discrete Mathematics and Optimization. Wiley–Interscience, Hoboken (1998)
Hansen, P., Jaumard, B., Lu, S.H.: A framework for algorithms in globally optimal design. J. Mech. Trans. Autom. Des. 111, 353–360 (1989)
Audet, C., Hansen, P., Jaumard, B., Savard, G.: A symmetrical linear maxmin approach to disjoint bilinear programming. Math. Program. 85, 573–592 (1999)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by H.P. Benson.
Work of the authors was partially supported by FCAR, MITACS and NSERC grants.
Rights and permissions
About this article
Cite this article
Audet, C., Savard, G. & Zghal, W. New Branch-and-Cut Algorithm for Bilevel Linear Programming. J Optim Theory Appl 134, 353–370 (2007). https://doi.org/10.1007/s10957-007-9263-4
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-007-9263-4