Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Fukushima (1992)
Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problemsMathematical Programming, 53
J. Bard (1984)
An investigation of the linear three level programming problemIEEE Transactions on Systems, Man, and Cybernetics, SMC-14
B. Hobbs, S. Nelson (1992)
A nonlinear bilevel model for analysis of electric utility demand-side planning issuesAnnals of Operations Research, 34
R. Jeroslow (1985)
The polynomial hierarchy and a simple model for competitive analysisMathematical Programming, 32
P. Marcotte, Daoli Zhu (1996)
Exact and inexact penalty methods for the generalized bilevel programming problemMathematical Programming, 74
G. Anandalingam, D. White (1990)
A solution method for the linear static Stackelberg problem using penalty functionsIEEE Transactions on Automatic Control, 35
H. Vaish, C. Shetty (1976)
The bilinear programming problemNaval Research Logistics Quarterly, 23
Omar Ben-Ayed (1993)
Bilevel linear programmingComput. Oper. Res., 20
W. Bialas, M. Karwan (1984)
Two-Level Linear ProgrammingManagement Science, 30
J. J. Júdice, A. M. Faustino (1988)
The solution of the linear bilevel programming problem by using the linear complementary problem, 8
L. Vicente, P. Calamai (1994)
Bilevel and multilevel programming: A bibliography reviewJournal of Global Optimization, 5
A. Ackere (1993)
The principal/agent paradigm: Its relevance to various functional fieldsEuropean Journal of Operational Research, 70
J. F. Bard, J. T. Moore (1990)
A branch and bound algorithm for the bilevel linear programming problem, 11
F. Leurent (1993)
Cost versus time equilibrium over a networkEuropean Journal of Operational Research, 71
(1988)
The solution of the linear bilevel programming problem by using the linear complementary problem," Investiga c~ ao Operacional
M. Ferris, J. Pang (1997)
Complementarity and variational problems : state of the art
P. Marcotte (1983)
Network design problem with congestion effects: A case of bilevel programmingMathematical Programming, 34
E. Aiyoshi, K. Shimizu (1984)
A solution method for the static constrained Stackelberg problem via penalty methodIEEE Transactions on Automatic Control, 29
J. Bard, J. Moore (1990)
A Branch and Bound Algorithm for the Bilevel Programming ProblemSIAM J. Sci. Comput., 11
志水 清孝, 石塚 陽, J. Bard (1996)
Nondifferentiable and Two-Level Mathematical Programming
D. White, G. Anandalingam (1993)
A penalty function approach for solving bi-level linear programsJournal of Global Optimization, 3
P. Loridan, J. Morgan (1988)
e-regularized two-level optimization problems: approximation and existence results
P. Hansen, B. Jaumard, G. Savard (1989)
New Branch-and-Bound Rules for Linear Bilevel ProgrammingSIAM J. Sci. Comput., 13
We consider a bilevel model where the leader wants to maximize revenues from a taxation scheme, while the follower rationally reacts to those tax levels. We focus our attention on the special case of a toll-setting problem defined on a multicommodity transportation network. We show that the general problem is NP-complete, while particular instances are polynomially solvable. Numerical examples are given.
Management Science – INFORMS
Published: Dec 1, 1998
Keywords: Keywords : Pricing ; Networks ; Bilevel
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.