Abstract
Two-stage methods of constructing an improved suboptimal solution of problems of integer linear programs with nonnegative coefficients are developed. A solution is constructed on the first stage on the basis of newly introduced criteria, and the indices of the intervals of the variables determined, where the coordinates of the optimal solution may differ from the suboptimal solutions already constructed. On the second stage, new solutions are constructed by varying the values of the variations only within these intervals and the best of these new solutions are selected. Computational experiments for high-dimension problems confirm the high degree of efficiency of the newly developed methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Korbut, A.A. and Finkel’shteyn, Yu.Yu., Diskretnoe Programmirovanie (Discrete Programming), Moscow: Nauka, 1969.
Emelichev, V.A. and Komlik, V.N., Metod Postroeniya Posledovatel’nosti Planov dlya Resheniya Zadach Diskretnoy Optimizatsii (A Method of Constructing Sequences of Designs for the Solution of Problems of Discrete Optimization), Moscow: Nauka, 1981.
Kovalev, M.M., Diskretnaya Optimizatsiya (Tselochislennoe Programmirovanie) (Discrete Optimization. Numerical Programming), Moscow: URSS, 2003.
Sergienko, I.V., Matematicheskie Modeli i Melody Resheniya Zadach Diskretnoy Optimizatsii (Mathematical Models and Methods for the Solution of Problems of Discrete Optimization), Kiev: Nauk. Dumka, 1988.
Schriyver, A., Theory of Linear and Integer Programming, New York/Chichester: Wiley & Sons, 1986.
Mortello, S. and Toth, P., Knapsack Problems. Algorithms and Computer Implementation, New York/Chichester: Wiley & Sons, 1990.
Kelleher, H., Pferschy, U., and Pisinger, D., Knapsack Problems, Berlin/Heidelberg: Springer-Verlag, 2004.
Babaev, Dzh. A., Mamedov, K.Sh., and Mekhtiev, M.G., Methods for the Construction of Suboptinmal Solutions of the Multidimensional Knapsack Problem, Vychisl. Matem. Matem. Fiz., 1978, vol. 28, no. 6, pp. 143–153.
Nuriev, U.G., On an Algorithm for the Solution of the Multidimensional Knapsack Problem, Izv. Akad. Nauk Azerb. Ser. Fiz. Tech. i Matem. Nauk, 2001, no. 2.
Mamedov, K.Sh. and Musaev, T.M., Methods for the Construction of Approximate Solutions of the Multidimensional Knapsack Problem and for Finding an Upper Bound of the Optimum, Avtom. Vychisl. Tekh. (Riga), 2004, no. 5, pp. 72–82 [Autom. Control Comput. Sci., 2004, no. 5].
Huseynov, S.Ya., Certain Algorithms for Finding Suboptimal Solutions of Boolean Programming Problems, Izv. Nats. Akad. Nauk Azerb. Ser. Fiz. Tech. i Matem. Nauk, 2003, no. 3, pp. 109–112.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © K.Sh. Mamedov, S. Ya. Huseynov, 2007, published in Avtomatika i Vychislitel’naya Tekhnika, 2007, No. 6, pp. 20–31.
About this article
Cite this article
Mamedov, K.S., Huseynov, S.Y. Methods of constructing suboptimal solutions of integer programming problems and successive improvement of these solutions. Aut. Conrol Comp. Sci. 41, 312–319 (2007). https://doi.org/10.3103/S014641160706003X
Received:
Issue Date:
DOI: https://doi.org/10.3103/S014641160706003X