论文信息 - Approximate solutions for two-level optimization problems - 字舞流文

Approximate solutions for two-level optimization problems

This paper is devoted to general results for approximating two-level optimization problems in which the set of solutions to the lower level problem is not a singleton.

Jacqueline Morgan | P. Loridan | J. Morgan | P. Loridan

[1] T. Başar,et al. Dynamic Noncooperative Game Theory , 1982 .

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

[3] S. M. Robinson,et al. A sufficient condition for continuity of optimal sets in mathematical programming , 1974 .

[4] T. Zolezzi. On stability analysis in mathematical programming , 1984 .

[5] Szymon Dolecki,et al. Tangency and differentiation: Some applications of convergence theory , 1982 .

[6] Anthony V. Fiacco,et al. Mathematical programming study 21 , 1985, Mathematical programming.

[7] R. Wets,et al. APPROXIMATION AND CONVERGENCE IN NONLINEAR OPTIMIZATION , 1981 .

[8] E. Aiyoshi,et al. A new computational method for Stackelberg and min-max problems by use of a penalty method , 1981 .

[9] J. Cruz,et al. Additional aspects of the Stackelberg strategy in nonzero-sum games , 1973 .

[10] J. B. Cruz,et al. Nonclassical control problems and Stackelberg games , 1979 .