×

Stackelberg solutions to multiobjective two-level linear programming problems. (English) Zbl 0945.90057

Authors’ summary: The author consider a multiobjective two-level linear programming problem in which the decision maker at each level has multiple-objective functions conflicting with each other. The decision maker at the upper level must take account of multiple or infinite rational responses of the decision maker at the lower level in the problem. They examine three kinds of situations based on anticipation of the decision maker at the upper level: optimistic anticipation, pessimistic anticipation, and anticipation arising from the past behavior of the decision maker at the lower level. Mathematical programming problems for obtaining the Stackelberg solutions based on the three kinds of anticipation are formulated and algorithms for solving the problems are presented. Illustrative numerical examples are provided to understand the geometrical properties of the solutions and demonstrate the feasibility of the proposed methods.
Reviewer: Mbunga

MSC:

90C29 Multi-objective and goal programming
90C05 Linear programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Simaan, M., and Cruz, J. B., JR., On the Stackelberg Strategy in Nonzero-Sum Games, Journal of Optimization Theory and Applications, Vol. 11, pp. 533–555, 1973. · Zbl 0243.90056
[2] Keeney, R. L., and Raiffa, H., Decisions with Multiple Objectives, Preferences, and Value Tradeoffs, John Wiley and Sons, New York, New York, 1976. · Zbl 0488.90001
[3] Bialas, W. F., and Karwan, M. H., Two-Level Linear Programming, Management Science, Vol. 30, pp. 1004–1020, 1984. · Zbl 0559.90053
[4] Bard, J. F., and Falk, J. E., An Explicit Solution to the Multi-Level Programming Problem, Computers and Operations Research, Vol. 9, pp. 77–100, 1982.
[5] Bard, J. F., An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem, Operations Research, Vol. 38, pp. 556–560, 1983.
[6] Fortuny-Amat, J., and McCarl, B., A Representation and Economic Interpretation of a Two-Level Programming Problem, Journal of the Operational Research Society, Vol. 32, pp. 783–792, 1981. · Zbl 0459.90067
[7] Bard, J. F., and Moore, J. T., A Branch-and-Bound Algorithm for the Bilevel Programming Problem, SIAM Journal on Scientific and Statistical Computing, Vol. 11, pp. 281–292, 1990. · Zbl 0702.65060
[8] White, D. J., and Anandalingam, G., A Penalty Function Approach for Solving Bilevel Linear Programs, Journal of Global Optimization, Vol. 3, pp. 397–419, 1993. · Zbl 0791.90047
[9] Wierzbicki, A. P., The Use of Reference Objectives in Multiobjective Optimization, Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, Germany, Vol. 177, pp. 468–486, 1980. · Zbl 0435.90098
[10] Kuhn, H. W., and Tucker, A. W., Nonlinear Programming, Proceedings of the 2nd Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, California, pp. 481–492, 1951.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.