Genetic algorithm based approach to bi-level linear programming
RAIRO - Operations Research - Recherche Opérationnelle, Tome 28 (1994) no. 1, pp. 1-21. 
@article{RO_1994__28_1_1_0,
     author = {Mathieu, R. and Pittard, L. and Anandalingam, G.},
     title = {Genetic algorithm based approach to bi-level linear programming},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {1--21},
     publisher = {EDP-Sciences},
     volume = {28},
     number = {1},
     year = {1994},
     mrnumber = {1269099},
     zbl = {0857.90083},
     language = {en},
     url = {http://archive.numdam.org/item/RO_1994__28_1_1_0/}
}
TY  - JOUR
AU  - Mathieu, R.
AU  - Pittard, L.
AU  - Anandalingam, G.
TI  - Genetic algorithm based approach to bi-level linear programming
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1994
SP  - 1
EP  - 21
VL  - 28
IS  - 1
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/RO_1994__28_1_1_0/
LA  - en
ID  - RO_1994__28_1_1_0
ER  - 
%0 Journal Article
%A Mathieu, R.
%A Pittard, L.
%A Anandalingam, G.
%T Genetic algorithm based approach to bi-level linear programming
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1994
%P 1-21
%V 28
%N 1
%I EDP-Sciences
%U http://archive.numdam.org/item/RO_1994__28_1_1_0/
%G en
%F RO_1994__28_1_1_0
Mathieu, R.; Pittard, L.; Anandalingam, G. Genetic algorithm based approach to bi-level linear programming. RAIRO - Operations Research - Recherche Opérationnelle, Tome 28 (1994) no. 1, pp. 1-21. http://archive.numdam.org/item/RO_1994__28_1_1_0/

A. R. Abdullah, A Robust Method for Linear and Nonlinear Optimization Based on Genetic Algorithm Cybernetica, 1991, 34, No. 4, pp. 279-287. | Zbl

F. A. Al Khayyal, Minimizing A Quasiconcave Function Over a Convex Set: A Case Solvable by Lagrangian Duality, Proceedings, I.E.E.E. International Conference on Systems, Man, and Cybernetics, Tucson, 1985, AZ, pp. 661-663.

G. Anandalingam, A Mathematical Programming Model of Decentralized Multi-Level Systems, J. of the Operational Research Society, 1988, 39, No. 11 | Zbl

G. Anandalingam and D. J. White, A Penalty Function Approach to Bi-Level Linear Programming, working paper, Department of Systems, University of Pennsylvania, August, 1988.

G. Anandalingam and T. L. Friesz, Hierarchical Optimization: An Introduction, Annals of Operations Research, 1992, 34, pp. 1-11. | MR | Zbl

J. F. Bard, An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem, Operations Research, 1983, July-August, pp. 670-684. | MR | Zbl

J. F. Bard and J. E. Falk, An Explicit Solution to the Multi-Level Programming Problem, Computers and Operations Research, 1982, 9, No. 1, pp. 77-100. | MR

H. P. Benson, On the Convergence of Two Branch and Bound Algorithms for Nonconvex Programming, J. of Optimization Theory and Application, 1982, 36, pp. 129-134. | MR | Zbl

A. D. Bethke, Genetic Algorithms as Function Optimizers, Ph. D. dissertation, unpublished, University of Michigan, Ann Arbor, 1981.

W. F. Bialas and M. H. Harwan, On Two-Level Optimization, I.E.E.E. Transactions on Automatic Control, 1982, AC-27, pp. 211-214. | Zbl

W. F. Bialas and M. H. Karwan, Two-Level Linear Programming, Management Science, 1984, 30, No. 8, August, pp. 1004-1020. | MR | Zbl

W. Candler and R. Townsley, A Linear Two-Level Programming Problem, Computers and Operations Research, 1982, 9, No. 1, pp. 59-76. | MR

L. Davis (Ed.), Genetic Algorithms and Simulated Annealing, Morgan Kaufman Publishers, Los Altos, CA, 1987 a. | Zbl

L. Davis, Performance of a Genetic Algorithm on the Network Link Size Problem, paper presented at the O.R.S.A./T.I.M.S. meeting, St. Louis, October, 1987 b.

K. De Jong, Adaptive System Design: A Genetic Approach, I.E.E.E., Transactions on Systems, Man, and Cybernetics, 1986, 16, Jan.-Feb.

J. E. Falk, A Linear Mini-Max Problem, Mathematical Programming, 1973, pp. 169-188. | MR | Zbl

C. S. Fisk, A Conceptual Framework for Optimal Transportation Systems Planning with Integrated Supply and Demand Models, Transportation Science, 1986, 20, No. 1, pp. 37-47.

J. Fortuny-Amat and B. Mccarl, A Representative and Economic Interpretation of a Two Level Programming Problem, J. of the Operational Research Society, 1981, 32, pp. 783-792. | MR | Zbl

T. L. Friesz and P. T. Harker, Multicriteria Spatial Price Equilibrium Network Design: Theory and Computational Results, Transportation Research, 1983, 17b, pp. 203-217. | Zbl

G. Gallo and A. Ulkucu, Bi-Linear Programming: An Exact Algorithm, Mathematical Programming, 1977, 12, pp. 173-194. | MR | Zbl

F. Glover, Convexity Cuts and Cut Search, Operations Research 1973, 21, pp. 123-134 | MR | Zbl

F. Glover, Future Paths for Integer Programming and Links to Artificial Intelligence, Computers & Operations Research, 1986, 13, (5). pp.533-549. | MR | Zbl

F. Glover, Tabu Search, mimeo, Center for Applied Artificial Intelligence, Graduate School of Business, Universiry of Colarado, October, 1987.

D. E. Goldberg and J. Richarsdon, Genetic Algorithms with Sharing Multi-Modal Function Optimization, in Genetic Algorithms and Their Application: Proceedings of the Second International Conference on Genetic Algorithms, M.I.T., Cambridge, MA, 1987.

J. Grefenstette, Optimization of Control Parameters for Genetic Algorithms, I.E.E.E. Transactions on Systems, Man, and Cybernetics, 1986, 16, (1), January-February, pp. 122-128. | Zbl

M. Grotschel and M. W. Padberg, On the Symmetric Travelling Salesman Problem I: Inequalities, II: Lifting Theorems and Facets, Mathematical Programming, 1979. 16, pp. 265-302. | MR | Zbl

Y. C. Ho, P. B. Luth and R. Muralidharan, Information Structures, Stackelberg Games, and Incentive Controllability, I.E.E.E. Transactions on Automatic Control, 1981, AC-31, No. 4, pp. 670-684. | Zbl

J. H. Holland, Adaption in Natural and Artificial Systems, The University of Michigan, 1975, Ann Arbor, MI, 1975. | MR | Zbl

S. Kirkpatrick, Combinatorial Search Using Simulated Annealing, paper presented at the O.R.S.A./T.I.M.S. meeting, St. Louis, October, 1987.

H. Konno, A Cutting Plane Algorithm for Solving Bilinear Programs, Mathematical Programming, 1976, 11, pp. 14-27. | MR | Zbl

V. Kumar and L. N. Kanal, Some New Insights into the Relationships Among Dynamic Programming, Branch and Bound, and Heuristic Search Procedures, Proceedings, I.E.E.E. International Conference on Systems, Man, and Cybernetics, 1983, pp. 19-23.

J.-J. Laffont and E. Maskin, The Theory of Incentives: An Overview, in W. HILDENBRAND Ed., Advances in Economic Theory, Cambridge University Press, Cambride, U.K., 1982, pp. 31-94. | Zbl

L. J. Leblanc and D. E. Boyce, A Bi-Level Programming Algorithm for Exact Solution of the Network Design Problem with User-Optimal Flows, Transportation Research B, 1986, 28, pp. 259-265. | MR

T. H. Matheiss and D. S. Rubin, A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets, Mathematics of Operations Research, 1980, 5, pp. 167-185. | MR | Zbl

P. M. Pardalos and J. B. Rosen, Methods for Global Concave Minimization: A Bibliographic Survey, S.I.A.M. Review, 1986, 28, (3), pp. 367-379. | MR | Zbl

A. H. G. Rinnooy and G. T. Timmer, Stochastic Global Optimization Methods, part I: Clustering Methods and part II: Multi-level, Methods Mathematical Programming, 1987, 39, No. 1, pp. 27-78. | MR | Zbl

J. D. Schaffer, Learning Multiclass Pattern Determination, in Proceedings of the International Conference on Genetic Algorithms and Their Applications, Robotics Institute of Carnegie-Mellon University, Pittsburg, PA, 1985. | Zbl

H. Von Stackelberg, The Theory of the Market Economy, Oxford Univesity Press, Oxford, 1952.

U. P. Wen and S. T. Hsu, Linear Bi-level Programming: A Review, J. of the Operational Research Society, 1991, 42, No. 2, pp. 125-133. | Zbl