Abstract
Dynamic problems of choosing optimal composition of a system of technical tools are formulated. Algorithms for their solution based on dual decomposition are pre sented. An exact polynomial time algorithm for solving subproblems is provided. It is proved that the duality gap can be arbitrarily large. A subclass of problems is identi fied such that the dual problem is poly normally solvable. Generalizations of the original problem are considered in which the production cost depends nonlinearly on the total output and additional restrictions on the composition of the system of technical tools. Suppose that during a certain planned period it is necessary to fulfill a given set of jobs. For fulfillment of the jobs there is a system of technical tools.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. I. Glebov, V. T. Dement’ev, and A. N. Sychëv (1971) On dynamics of development of homogeneous technical systems (in Russian), Upravlyaemye Sistemy 8, 51–67.
V. L. Beresnev, È. Kh. Gimadi, and V. T. Dement’ev (1978) Extremal Stan dardization Problems (in Russian), Nauka, Novosibirsk.
V. R. Khachaturov and N. D. Astakhov (1976) Dynamic location problems (mod els and methods for solution) (in Russian), Ekonom. i Mat. Metody 12, No. 1, 93–109.
S. K. Jacobsen (1977) Heuristic solutions to dynamic plant location problems, Advances in Operations Research: Proc. EURO II. Second European Congress on Operations Research, North-Holland, Amsterdam etc., pp. 207–213.
D. Erlenkot ter (1981) A comparative study of approaches to dynamic location problems, European J. Oper. Res. 6, No. 2, 133–143.
T. J. Van Roy and D. Erlenkotter (1982) A dual-based procedure for dynamic facility location, Management Sci. 28, No. 10, 1091–1105.
V. L. Beresnev, G. I. Ibragimov, and Yu. A. Kochetov (1984) Algorithms for solving the problem of optimal choice of a dynamic series of goods (in Russian), Upravlyaemye Sistemy 24, 3–19.
M. R. Garey and D. S. Johnson (1979) Computers and Intractability, Freeman, San Francisco.
M. Held, P. Wolfe, and H. Crowder (1974) Validation of subgradient optimization, Math. Programming 6, No. 1, 62–88.
M. E. Dyer (1984) A O(n) algorithm for the multiple-choice knapsack linear program, Math. Programming 29, No. 1, 57–63.
S. Martello and P. Toth (1987) Linear assignment problems. Surveys in Combi natorial Optimization, North-Holland, Amsterdam and New York, pp. 259–282.
S. Ahn, C. Cooper, G. Cornuejols and A. Frieze (1988) Probabilistic analysis of a relaxation for the K-median problem, Math. Oper. Res. 13, No. 1, 1–31.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Kochetov, Y.A., Pashchenko, M.G. (1997). Dynamic Problems of Choosing Optimal Composition of a System of Technical Tools. In: Operations Research and Discrete Analysis. Mathematics and Its Applications, vol 391. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5678-3_8
Download citation
DOI: https://doi.org/10.1007/978-94-011-5678-3_8
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6395-1
Online ISBN: 978-94-011-5678-3
eBook Packages: Springer Book Archive