Literature Cited
V.S. Nemchinov (editor), Methods and Algorithms for Solving Transportation Problems [in Russian], Vol. 1, Gostekhizdat, Moscow (1963).
Huang Tui, “Concave programming,” Dokl. Akad. Nauk SSSR,159, No. 1 (1964).
V.A. Emelichev, “Concave programming with separable objective function with linear constraints,” Izv. Akad. Nauk BSSR, Ser. Fiz.-Matem. Nauk, 6 (1969).
A.D. Zaikin and R.M. Petukhov, “Solving problems of allocating industrial enterprises by the method of random search,” in: Application of Mathematics to Economics [in Russian], Mysl', Moscow (1965).
V.A. Emelichev and V.I. Komlik, “On some problems of allocating production,” Dokl. Akad. Nauk BSSR,12, No. 10 (1968).
A.M. Gal'perin, “On one algorithm for solving single-product allocation problems,” in: Engineering and Economic Information [in Russian], in the series, Economics of the Chemical Industry, No. 8, NIITEKhIM, Moscow (1968).
A.M. Gal'perin, “On one class of methods of discrete programming,” in: Proceedings of the First Winter School on Mathematical Programming [in Russian], TsEMI, Moscow (1969).
E. Balas, “A note on the branch-and-bound principle,” Operations Research,16, No. 2 (1968).
S.S. Lavrov, A Universal Programming Language [in Russian], Nauka, Moscow (1964).
L. Ford, Jr., and D. Fulkerson, Flows in Networks, Princeton Univ. Press (1962).
Additional information
Translated from Kibernetika, No. 3, pp. 60–69, May–June, 1971.
Rights and permissions
About this article
Cite this article
Gal'perin, A.M. Two problems of optimal allocation of production. Cybern Syst Anal 7, 460–471 (1971). https://doi.org/10.1007/BF01070455
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01070455