A bilevel model of taxation and its application to optimal highway pricing

Management Science

Volumn 44, Issue 12 PART 1, 1998, Pages 1608-1622

  Labbé, Martine ^a   Marcotte, Patrice ^a   Savard, Gilles ^a  

^a NONE

Author keywords

Bilevel; Networks; Pricing

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MOTOR TRANSPORTATION; OPTIMIZATION; PROBLEM SOLVING; URBAN PLANNING;

BILEVEL MODELS; OPTIMAL HIGHWAY PRICING;

TAXATION;

EID: 0032295962     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.44.12.1608     Document Type: Article

References (23)

1. Aiyoshi, E., K. Shimizu. 1984. A solution method for the static constrained Stackelberg problem via penalty methods. IEEE Trans. Automat. Control 29 1111-1114.
2. Anandalingam, D. J. White. 1990. A solution method for the linear static Stackelberg problem using penalty functions. IEEE Trans. Automat. Control 35 1170-1173.
3. Bard, J. 1984. An investigation of the linear three-level programming problem. IEEE Trans. Systems, Man and Cybernetics 14 711-717.
4. Bard, J. F., J. T. Moore. 1990. A branch and bound algorithm for the bilevel linear programming problem. SIAM J. Sci. Stat. Comput. 11281-292.
5. Ben-Ayed, O. 1993. Bilevel linear programming. Comput. Oper. Res. 20 485-501.
6. Bialas, W., M. Karwan. 1984. Two-level linear programming. Management Sci. 30 1004-1020.
7. Júdice, J. J., A. M. Faustino. 1988. The solution of the linear bilevel programming problem by using the linear complementary problem. Investigaçãte Oper. 8 77-95.
8. Fukushima, M. 1992. Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems. Math. Programming 53 99-110.
9. Hobbs, B., S. Nelson. 1992. A nonlinear bilevel model for analysis of electric utility demand-side planning issues. Ann. Oper. Res. 34 255-274.
10. Hansen, P., B. Jaumard, G. Savard. 1992. New branch-and-bound rules for linear bilevel programming. SIAM J. Sci. Stat. Comput. 13 1194-1217.
11. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York.
12. Jeroslow, R. G. 1985. The polynomial hierarchy and a simple model for competitive analysis. Math. Programming 32 146-164.
13. Leurent, F. 1993. Cost versus time equilibrium over a network. European J. Oper. Res. 71 205-221.
14. Luo, Z. Q., J. S. Pang, D. Ralph. 1996. Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge.
15. Loridan, P., J. Morgan. 1989. ε-regularized two-level optimization problems: approximation and existence results. Fifth FrenchGerman Conference on Optimization. Lecture Notes in Mathematics 1405, Springer-Verlag, 99-113.
16. Marcotte, P. 1986. Network design problem with congestion effects: A case of bilevel programming. Math. Programming 34 142-162.
17. Marcotte, P., D. Zhu. 1996. Exact and inexact penalty methods for the generalized bilevel programming problem. Math. Programming 74 141-157.
18. Marcotte, P., D. Zhu. 1997. Equilibria with infinitely many differentiated classes of customers. M. C. Ferris, J. S. Pang, eds. Complementarity and variational problems. State of the art. SIAM, Philadelphia, PA.
19. Shimizu, K., Y. Ishizuka, J. F. Bard. 1997. Nondifferentiable and Two-Level Mathematical Programming. Kluwer, Boston, MA.
20. Vaish, H., C. M. Shetty. 1976. The bilinear programming problem. Naval Res. Logist. Quart. 23 303-309.
21. van Ackere, A. 1993. The principal / agent paradigm: its relevance to various functional fields. European J. Oper. Res. 70 83-103.
22. Vicente, L. N., P. H. Calamai. 1994. Bilevel and multilevel programming: a bibliography review. J. Global Optim. 5 291-306.
23. White, D. J., and Anandalingam. 1993. A penalty function approach for solving bilevel linear programs. J. Global Optim. 3 397-419.