ON AN ITERATIVE METHOD FOR SOLVING LINEAR AND CONVEX PROGRAMMING PROBLEMS
Table of contents
Share
QR
Metrics
ON AN ITERATIVE METHOD FOR SOLVING LINEAR AND CONVEX PROGRAMMING PROBLEMS
Annotation
PII
S042473880000621-2-1
Publication type
Article
Status
Published
Pages
593-600
Abstract
Экономика и математические методы, ON AN ITERATIVE METHOD FOR SOLVING LINEAR AND CONVEX PROGRAMMING PROBLEMS
Date of publication
01.07.1967
Number of purchasers
0
Views
624
Readers community rating
0.0 (0 votes)
Cite Download pdf
Additional services access
Additional services for the article
1

References



Additional sources and materials

1. K. W. Carroll. A method of the response surface for optimization of nonlinear bounded systems is created. Opn. Res., 1961, vol. 9. No. 2.

2. N. P. Buslenko, G. A. Sokolov. On a class of optimal distribution problems. Economics and Math. methods, 1965, vol. 1, issue 1.
3. T. Petrzykowski. On an iterative method for maximizing a concave function on a convex set. Preis ZAM, 1961, p. A, N 13
4. K. D. Arrow, L. Hurwitz, H. Uzzawa. Studies on linear and nonlinear programming. M., Publishing house of foreign Lit., 1962.
5. M. B. Rybashov. Gradient method for solving convex programming problems on an electronic model. Automation and Telemechanics, 1965, vol. XXVI, No. 11.
6. V. T. Polyak. Gradient methods for minimizing functionals. K. computes. matem. and Math. phys., 1963, vol. 3, No. 4.
7. A. J. Hoffman. On approximate systems of solutions of linear inequalities. I. Res. nats. Bureau Standards, 1952, vol. 49, No. 4.

Comments

No posts found

Write a review
Translate