Semistochastic decomposition scheme in mathematical programming and game theory
Kybernetika, Tome 27 (1991) no. 6, pp. 535-541 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 49K35, 90-08, 90C15, 90C30, 91A05, 93D05
@article{KYB_1991_27_6_a4,
     author = {Chien, Tran Quoc},
     title = {Semistochastic decomposition scheme in mathematical programming and game theory},
     journal = {Kybernetika},
     pages = {535--541},
     year = {1991},
     volume = {27},
     number = {6},
     mrnumber = {1150941},
     zbl = {0749.90075},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1991_27_6_a4/}
}
TY  - JOUR
AU  - Chien, Tran Quoc
TI  - Semistochastic decomposition scheme in mathematical programming and game theory
JO  - Kybernetika
PY  - 1991
SP  - 535
EP  - 541
VL  - 27
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/KYB_1991_27_6_a4/
LA  - en
ID  - KYB_1991_27_6_a4
ER  - 
%0 Journal Article
%A Chien, Tran Quoc
%T Semistochastic decomposition scheme in mathematical programming and game theory
%J Kybernetika
%D 1991
%P 535-541
%V 27
%N 6
%U http://geodesic.mathdoc.fr/item/KYB_1991_27_6_a4/
%G en
%F KYB_1991_27_6_a4
Chien, Tran Quoc. Semistochastic decomposition scheme in mathematical programming and game theory. Kybernetika, Tome 27 (1991) no. 6, pp. 535-541. http://geodesic.mathdoc.fr/item/KYB_1991_27_6_a4/

[1] G. B. Dantzig, P. Wolfe: The decomposition algorithm for linear programs. Econometrica 29 (1961), 4, 767-778. | MR | Zbl

[2] J. F. Benders: Partitioning procedures for solving mixed variable programming problems. Numer. Math. 4 (1962), 238-260. | MR

[3] A. Geoffrion: Generalized Benders decomposition. J. Optim. Theory Appl. 10 (1972), 237-260. | MR | Zbl

[4] T. J. Van Roy: Cross decomposition for mixed integer programming. Mathematical Programming 25 (1983), 46-63. | MR | Zbl

[5] I. Kornai, T. Liptak: Planning on two levels. In: Application of Mathematics in Economical Research 4, Moscow 1965. In Russian. | MR

[6] R. E. Burkard H. W. Hamacher, J. Tind: On general decomposition schemes in mathematical programming. Mathematical Programming Study 24 (1985), 238-252. | MR

[7] V. Z. Belinskij V. A. Volkonskii S. A. Ivankov A. B. Pomanskii, A. D. Shapiro: Iterative Methods in Game Theory and Mathematical Programming. Nauka, Moscow 1974. In Russian.

[8] V. V. Fedorov: Maximin Numerical Methods. Nauka, Moscow 1979.

[9] I. Ekeland, R. Temam: Analyse Convexe et Problemes Variationnels. Dunod, Paris 1974. | MR | Zbl

[10] G. D. Maistrovskii: Gradient methods for finding saddle points. Econom. i Mat. Metody 12 (1976), 917-929. In Russian. | MR

[11] E. G. Golstein: Gradient methods for determination of saddle points and modified Lagrangians. In: Proc. of the Workshop ,,Math. Optimierung - Theorie und Anwendungen'' Wartburg/Eisenach 1983.

[12] R. T. Rockafellar: A dual approach to solving nonlinear programming problems by un- constrained optimization. Math. Programming 5 (1973), 354-373. | MR

[13] Tran Quoc Chien: Nondifferentiable and quasidifferentiable duality in vector optimization theory. Kybernetika 21 (1985), 4, 298-321. | MR | Zbl

[14] Tran Quoc Chien: Fenchel-Lagrange duality in vector fractional programming via abstract duality scheme. Kybernetika 22 (1986), 4, 299-319. | MR | Zbl

[15] Tran Quoc Chien: Perturbation theory of duality in vector optimization via the abstract duality scheme. Kybernetika 23 (1987), 1, 67-81. | MR | Zbl

[16] Tran Quoc Chien: Vector nonconvex perturbational duality theory via the abstract duality scheme. Essays on Nonlinear Analysis and Optimization Problems. Ha-Noi 1987. | Zbl

[17] B. Gnedenko: The Theory of Probability. Nauka, Moscow 1973.

[18] N. N. Vorobiev: Elements of Game Theory: Noncooperative Games. Nauka, Moscow 1984.