Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

On the numerical solution of a class of Stackelberg problems

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

This study tries to develop two new approaches to the numerical solution of Stackelberg problems. In both of them the tools of nonsmooth analysis are extensively exploited; in particular we utilize some results concerning the differentiability of marginal functions and some stability results concerning the solutions of convex programs. The approaches are illustrated by simple examples and an optimum design problem with an elliptic variational inequality.

Zusammenfassung

Diese Arbeit zielt auf eine Entwicklung von neuen Verfahren für die numerische Lösung der Stackelbergproblemen. In beiden vorgeschlagenen Verfahren nützt man die Mittel der nichtglatten Analysis aus. Besonders handelt es sich um eine Charakterisierung der verallgemeinerten Gradienten von marginalen Funktionen und einige StabilitÄtsergebnisse, die die Lösungen von konvexen Programmen betreffen. Die Verfahren sind durch einfache Beispiele und ein Optimum Design Problem mit einer elliptischen Variationsungleichung illustriert.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Aubin JP, Ekeland I (1984) Applied nonlinear analysis. Wiley, New York

    Google Scholar 

  • Bank B, Guddat J, Klatte D, Kummer B, Tammer K (1982) Non-linear parametric optimization. Akademie-Verlag, Berlin

    Google Scholar 

  • Basar T, Olsder GJ (1982) Dynamic noncooperative game theory. Academic Press, London

    Google Scholar 

  • Clarke FH (1983) Optimization and nonsmooth analysis. Wiley, New York

    Google Scholar 

  • Gauvin J, Dubeau F (1982) Differential properties of the marginal function in mathematical programming. Math Prog Study 19:101–119

    Google Scholar 

  • Hager WW (1979) Lipschitz continuity for constrained processes. SIAM J Contr Optim 17:321–338

    Google Scholar 

  • Haslinger J, NeittaanmÄki P (1988) Finite element approximation for optimal shape design. Theory and applications. Wiley, Chichester

    Google Scholar 

  • Haslinger J, Roubíček T (1986) Optimal control of variational inequalities. Approximation and numerical realization. Appl Math Optim 14:187–201

    Google Scholar 

  • Hiriart-Urruty JB (1978) Gradients generalises de fonctions marginales. SIAM J Contr Optim 16:301–316

    Google Scholar 

  • Jittorntrum K (1984) Solution point differentiability without strict complementarity in nonlinear programming. Math Prog Study 21:127–138

    Google Scholar 

  • Kiwiel KC (1985) Methods of descent for nondifferentiable optimization. Lecture Notes Math, vol 1133. Springer-Verlag, Berlin

    Google Scholar 

  • Lemaréchal C, Strodiot JJ, Bihain A (1980) On a bundle algorithm for nonsmooth optimization. NPS 4, Madison

  • Loridan P, Morgan J (1988) Approximate solutions for two-level optimization problems. International Series of Numerical Mathematics, vol 84. BirkhÄuser, Basel, pp 181–196

    Google Scholar 

  • Malanowski K (1985) Differentiability with respect to parameters of solutions to convex programming problems. Math Prog 33:352–361

    Google Scholar 

  • Outrata JV (1988) On the usage of bundle methods in optimal control of nondifferentiable systems. In: Hoffman KH, Hiriart Urruty JB, Lemaréchal C, Zowe J (eds) Trends in mathematical optimization. BirkhÄuser, Basel, pp 233–246

    Google Scholar 

  • Outrata JV (1990) On generalized gradients in optimization problems with set-valued constraints. To appear in Math Oper Res

  • Pschenichnyi BN (1980) Convex analysis and extremal problems. Nauka, Moscow (in Russian)

    Google Scholar 

  • Robinson SM (1980) Generalized equations and their solutions. Part II: Application to nonlinear programming. Univ. Wisconsin-Madison, Technical Summary Rp. #2048

  • Rockafellar RT (1984) Directional differentiability of the optimal value function in a nonlinear programming problem. Math Prog Study 21:213–226

    Google Scholar 

  • Schittkowski K (1985) NLPQL: A Fortran subroutine solving constrained nonlinear programming problems. Annals Oper Res: 485–500

  • Shimizu K, Aiyoshi E (1981) A new computational method for Stackelberg and min-max problems by use of a penalty method. IEEE Trans Autom Contr AC-26:460–466

    Google Scholar 

  • Von Stackelberg H (1952) The theory of market economy. Oxford University Press, Oxford

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Prepared while the author was visiting the Department of Mathematics, University of Bayreuth as a guest of the FSP „Anwendungsbezogene Optimierung und Steuerung“.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Outrata, J.V. On the numerical solution of a class of Stackelberg problems. ZOR - Methods and Models of Operations Research 34, 255–277 (1990). https://doi.org/10.1007/BF01416737

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01416737

Key words