OPTIMAL PLANNING IN CONDITIONS OF LARGE DIMENSION (ITERATIVE METHODS AND THE DECOMPOSITION PRINCIPLE)
Table of contents
Share
QR
Metrics
OPTIMAL PLANNING IN CONDITIONS OF LARGE DIMENSION (ITERATIVE METHODS AND THE DECOMPOSITION PRINCIPLE)
Annotation
PII
S042473880000621-2-1
Publication type
Article
Status
Published
Pages
195-219
Abstract
Экономика и математические методы, OPTIMAL PLANNING IN CONDITIONS OF LARGE DIMENSION (ITERATIVE METHODS AND THE DECOMPOSITION PRINCIPLE)
Date of publication
06.03.1965
Number of purchasers
0
Views
716
Readers community rating
0.0 (0 votes)
Cite   Download pdf

References



Additional sources and materials

1. Dzh. Dantsig, F. Vol'f. Algoritm razlozheniya dlya zadach linejnogo programmirovaniya. Matematika, 1964, t. 8, № 1. , , . j i
2. J. Kornai T. Liptak. Ketszintii tervezes: jatekelmeleti modell es iterativ szarnitassi
cijaro’s nepgazdasagi tavlati tervezesi feladatok megoldasara. Madyar lud.
akad. Mat. Kutato int. Kozl., 1962 (1963), vol. 7, No. 4.
3- B. A. V 0 L k 0 P c k i ii. Sistema tekuschego planirovaniya s pomosch'yu otsenok re-
<^Ursov pa osnove matrichnykh modelej. Sb. Plapprovanpe p ehkono.mpko-matematp-
cheskpe modelp. M.. pzd-vo «Nauka», 1964.
Dzh. Robinson. Iterativnyj metod reshenpya igr. Sb. Matrichnye pgry. M.,
5- V, t. Polyak. O nekotorykh sposobakh uskoreniya skhodimosti iteratsionnykh meto-
j vychpslpt. matem. i matem. fpzpkp, 1964, t. 4, № o. lt i 1 ●
6. M. Frank, R. Wolfe. Ap Algorilhm for quadratic programming. Naval res. logistics
quart., 1956, vol. 3, No. 1—2.
'● I- 3. Shor. O strukture algoritmov chislennogo reshenpya zadach optimal'nogo
plapirovappya i proektirovaniya. Dissertatsiya. Ipstptut matematp'i Institut
o -^“berpstikp AN USSR, Kiev, 1964.
K. Dzh. Ehrrou, L. Gurvpts, X. Udzava. Issledovaniya po lpposhyumu i peli-
psinomu programmirovaniyu. M., Izd-vo pnostr. lsh'., 1962._
R. L. Bulavekpj. Iterativnyj metod reshenpya ooschep zadachi linejnogo pro-
grammprovapiya. Sb. Chislennye metody optimal'nogo playprovanpya. SO AN
il ehkonom.-matsm. ser., 1962, vyp. I. „
iO- R. Belmap, I. Glpksberg, O. Gross. Nekotorye voprosy matematicheskom
II protsessov upravleniya. M., Izd-vo pnostr. lit., 1962. . t t -
V. Rosen. The gradient projection method for nonlinear programming. P. I. Li- . 
constraints. Industr. Appl. Mathcm., 1960, vol.^8, No. 1.
io' L' ^ 6JL. Teoriya lppejiykh ehkonomicheskikh modelej. M., Izd-vo pnostr. lit., IJbd.
i/ p Obschaya teoriya igr neskolyshkh lpts. M.. Fpzmatgiz, 1961.
S. k a r l p i. Matematicheskie lttody v teorii igr, programmirovanii i ehkoionzd-po «Mpr)>, 1964. , , . .
m "rtos. The direct power of simplicial methods sh continuous programming.
Magyar tud akad Kozl. int. In-t ehkonomiki Vengerskoj Akademii nauk, 1964.
a n s k i n. Iterativnyj metod reshenpya nepreryvnykh igr. Sb. Besko
nechnye aitagolpepsheekpe igry. M., Fpzmatgiz, 1963.

Comments

No posts found

Write a review
Translate