Advertisement

A Service Location Model in a Bi-level Structure

  • Zaida E. Alarcón-Bernal
  • Ricardo Aceves-García
Chapter
  • 43 Downloads

Abstract

The principal aim of this chapter is to show a network location services model for a specific problem, which has originally been formulated as one with one objective. The multi-objective strategy has been useful in situations where there is more than one objective and where in many cases they may be contradictory. Such approach does not consider interdependence among each other. Multilevel programming, on the other hand, does take it into consideration, which allows for a hierarchical organization of the objectives and the consideration of relationships among them. The proposed model was applied for a drug distribution network in the State of Mexico, for which optimum storage location is suggested.

Keywords

Bi-level programming Location Networks Distribution 

References and Bibliography

  1. E. Aiyoshi, Shimizu, Hierarchical decentralized systems and its new solution by barrier method. IEEE Trans. Syst. Man Cybern. 11, 444–448 (1981)MathSciNetCrossRefGoogle Scholar
  2. G. Savard, J. Gauvin, The steepest descent direction for the nonlinear bilevel programming problem. Technical Report G-90-37, Groupe d’ Études et de Recherche en Analyse des Décisions (1990)Google Scholar
  3. G. M. Roodman, Postoptimality analysis in zero-one programming by implicit enumeration. Naval Res. Logist. Quarterly. 19(3), 435–447 (1972)Google Scholar
  4. H. Benson, On the structure and properties of a linear multilevel programming problem. J. Optim. Theory Appl. 60, 353–373 (1989)MathSciNetCrossRefGoogle Scholar
  5. H. Stackelberg, Market Structure and Equilibrium (Springer-Verlag Wien, New York, 1934)zbMATHGoogle Scholar
  6. J. Bard, Optimality conditions for the bilevel programming problem. Naval Research Logistics Quarterly 31, 13–26 (1984)MathSciNetCrossRefGoogle Scholar
  7. J. Bard, Some properties of the bilevel programming problem. J. Optim. Theory Appl. 68, Technical note, 371–378 (1991)MathSciNetCrossRefGoogle Scholar
  8. J. Bard, Practical Bilevel Optimization. Algorithms and Applications (Kluwer Academic Publishers, Boston, 1998)CrossRefGoogle Scholar
  9. J. F. Bard, J.E. Falk, An explicit solution to the multi-level programming problem. Comput. Oper. Res. 9(1), 77–100 (1982)MathSciNetCrossRefGoogle Scholar
  10. J. Bard, J. Moore, An algorithm for the discrete bilevel programming problem. Nav. Res. Logist. 39, 419–435 (1992)MathSciNetCrossRefGoogle Scholar
  11. J. Braken, J. McGill, Mathematical programs with optimization problems in the constraints. Oper. Res. 21, 21–37 (1973)MathSciNetGoogle Scholar
  12. J. Outrata, Necessary optimality conditions for Stackelberg problems. J. Optim. Theory Appl. 76, 305–320 (1993)MathSciNetCrossRefGoogle Scholar
  13. J. Ye, D. Zhu, Optimality conditions for bi-level programming problems. Technical Report DMS-618-IR, Department of Mathematics and Statistics, University of Victoria (1993)Google Scholar
  14. L. Vicente, P. Calamai, Geometry and local optimality conditions for bi-level programs with quadratic strictly convex lower level. Technical Report #198-O-150294, Department of Systems Design Engineering, University of Waterloo (1994)Google Scholar
  15. O. Ben-Ayed, C. Blair, Computational difficulties of bilevel linear programming. Oper. Res. 38, 556–560 (1990)MathSciNetCrossRefGoogle Scholar
  16. P. Hansen, B. Jaumard, G. Savard, New branch and bound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 13, 1194–1217 (1992)MathSciNetCrossRefGoogle Scholar
  17. R. Jeroslow, The polynomial hierarchy and simple model for competitive analysis for competitive analysis. Math. Program. 32, 146–164 (1985)Google Scholar
  18. S. Dempe, A necessary and sufficient optimality condition for bilevel programming prob- lems. Optimization 25, 341–354 (1992)MathSciNetCrossRefGoogle Scholar
  19. S. Dempe, Foundations of Bilevel Programming (Kluwer Academic Publishers, United States of America, 2002)zbMATHGoogle Scholar
  20. U. Wen, Mathematical methods for multilevel linear programming. PhD thesis, Department of Industrial Engineering, State University of New York at Buffalo (1981)Google Scholar
  21. W. Bialas, M. Karwan, J. Shaw, “A parametric complementary pivot approach for two-level linear programming.” State University of New York at Buffalo. 57 (1980)Google Scholar
  22. W. Candler, R. Norton, Multilevel programming. Technical Report 20, World Bank Development Research Center, Washington D.C. (1977)Google Scholar
  23. Y. Chen, M. Florian, The nonlinear bilevel programming problem: A general formulation and optimality conditions. Technical Report CRT-794, Centre de Recherché sur les Transports (1991)Google Scholar
  24. Y. Ishisuka, Optimality conditions for quasi-differentiable programs with applications to two-level optimization. SIAM J. Control. Optim. 26, 1388–1398 (1988)MathSciNetCrossRefGoogle Scholar
  25. Z. Bi, P. Calami, Optimality conditions for a class of bilevel programming problems. Technical Report #191-O-191291, Department of Systems Design Engineering, University of Waterloo (1991)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2021

Authors and Affiliations

  • Zaida E. Alarcón-Bernal
    • 1
  • Ricardo Aceves-García
    • 2
  1. 1.Department of Biomedical Systems Engineering, Faculty of EngineeringNational Autonomous University of MexicoMexico CityMexico
  2. 2.Department of Systems, Faculty of EngineeringNational Autonomous University of MexicoMexico CityMexico

Personalised recommendations