Algorithms for solving the mixed integer two-level linear programming problem. (English) Zbl 0683.90055
Summary: 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 exact and heuristic solution procedures based on the branch- and-bound technique for solving the problem. Computational experience and comparisons will be presented.
MSC:
| 90C11 | Mixed integer programming |
| 90C05 | Linear programming |
| 65K05 | Numerical mathematical programming methods |
References:
| [1] | Evans, G. W., An overview of techniques for solving multiobjective mathematical programs, Mgmt Sci., 30, 1268-1282 (1984) · Zbl 0551.90090 |
| [2] | Kiziltan, G.; Yucaoglu, E., An algorithm for multiobjective zero-one linear programming, Mgmt Sci., 29, 1444-1453 (1983) · Zbl 0542.90065 |
| [3] | Winkofsky, E. P.; Baker, N. R.; Sweeney, D. J., A decision process model of R & D resource allocation in hierarchical organizations, Mgmt Sci., 27, 268-283 (1981) |
| [4] | Fortuny-Amat, J.; McCarl, B., A representation and economic interpretation of two-level programming problem, J. Opl Res. Soc., 32, 783-792 (1981) · Zbl 0459.90067 |
| [5] | Bard, J. F.; Falk, J. E., An explicit solution to the multi-level programming problem, Computers Opns Res., 9, 77-100 (1982) |
| [6] | Candler, W. V.; Townsley, R. J., A linear two-level programming problem, Computers Opns Res., 9, 59-76 (1982) |
| [7] | Bard, J. F., An algorithm for solving the general bilevel programming problem, Mathemat. Opns Res., 8, 260-272 (1983) · Zbl 0516.90061 |
| [8] | Bard, J. F., Optimality conditions for the bilevel programming problem, Naval Res. Log. Q., 31, 13-26 (1984) · Zbl 0537.90087 |
| [9] | Bialas, W. F.; Karwan, M. H., Two-level linear programming, Mgmt Sci., 30, 1004-1020 (1984) · Zbl 0559.90053 |
| [10] | Kochenberger, G. A.; Richard, V. H., A simple, all primal branch and bound approach to pure and mixed integer binary programs, Opns Res. Lett., 1, 182-185 (1982) · Zbl 0504.90049 |
| [11] | Martin, R. K.; Sweeney, D. J.; Doherty, M. E., The reduced cost branch and bound algorithm for mixed integer programming, Computers Opns Res., 12, 139-149 (1985) · Zbl 0606.90098 |
| [12] | Fox, G. E.; Scudder, G. D., A simple strategy for solving a class of 0-1 integer programming models, Computers Opns Res., 13, 707-712 (1986) · Zbl 0619.90046 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
