论文信息 - Stackelberg Solutions to Multiobjective Two-Level Linear Programming Problems - 字舞流文

Stackelberg Solutions to Multiobjective Two-Level Linear Programming Problems

M. Sakawa | I. Nishizaki

[1] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .

[2] G. Anandalingam,et al. A penalty function approach for solving bi-level linear programs , 1993, J. Glob. Optim..

[3] Charles E. Blair,et al. Computational Difficulties of Bilevel Linear Programming , 1990, Oper. Res..

[4] Jonathan F. Bard,et al. A Branch and Bound Algorithm for the Bilevel Programming Problem , 1990, SIAM J. Sci. Comput..

[5] Wayne F. Bialas,et al. Two-Level Linear Programming , 1984 .

[6] Jonathan F. Bard,et al. An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem , 1983, Oper. Res..

[7] Jonathan F. Bard,et al. An explicit solution to the multi-level programming problem , 1982, Comput. Oper. Res..

[8] José Fortuny-Amat,et al. A Representation and Economic Interpretation of a Two-Level Programming Problem , 1981 .

[9] Andrzej P. Wierzbicki,et al. The Use of Reference Objectives in Multiobjective Optimization , 1979 .

[10] R. L. Keeney,et al. Decisions with Multiple Objectives: Preferences and Value Trade-Offs , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[11] J. Cruz,et al. On the Stackelberg strategy in nonzero-sum games , 1973 .