Abstract
The paper studies complex integer optimization problems with inexact coefficients of the linear objective function and convex quadratic constraint functions. Exact and approximate decomposition methods are developed and proved to search for guaranteeing and optimistic solutions to such problems. The methods are based on approximation of initial problems by problems of a simpler structure.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
I. V. Sergienko, Mathematical Models and Methods of Solving Discrete Optimization Problems [in Russian], Naukova Dumka, Kyiv (1988).
I. V. Sergienko and V. P. Shilo, Discrete Optimization: Problems, Solution Methods, Analysis [in Russian], Naukova Dumka, Kyiv (2003).
V. M. Glushkov, “Systemwise optimization,” Cybernetics, 16, No. 5, 731–732 (1980).
N. V. Semenova, “Solving integer optimization problems on convex sets under uncertainty,” Teor. Optym. Rishen’, No. 4, 107–112 (2005).
N. V. Semenova, “Solution of a generalized integer-valued programming problem,” Cybernetics, 20, No. 5, 641–651 (1984).
I. V. Sergienko, V. O. Roshchin, and N. V. Semenova, “Solving inexact integer programming problems, ” Dop. AN URSR, Ser. A, No. 61–64 (1988).
V. A. Roshchin, N. V. Semenova, and I. V. Sergienko, “Solution and investigation of one class of inexact integer programming problems,” Cybernetics, 25, No. 2, 185–192 (1989).
V. A. Roshchin, N. V. Semenova, and I. V. Sergienko, “Decomposition approach to solving some integer programming problems with inexact data,” Zh. Vych. Mat. Mat. Fiz., 29, No. 5, 786–791 (1990).
I. V. Sergienko and N. V. Semenova, “Integer programming problems with inexact data: exact and approximate solutions,” Cybern. Syst. Analysis, 31, No. 6, 842–851 (1995).
I. V. Sergienko, V. A. Roshchin, and N. V. Semenova, “Some integer programming problems with ambiguous data and their solution,” Probl. Upravl. Inform., No. 6, 116–123 (1998).
R. Rockafellar, Convex Analysis, Princeton Univ. Press (1970).
L. S. Lasdon, Optimization Theory for Large Systems, Macmillan, New York (1970).
B. N. Pshenichnyi, Linearization Method [in Russian], Nauka, Moscow (1983).
J. Kelley, “The cutting plane method for solving convex program,” SIAM J., 8, No. 4, 703–712 (1960).
J. Ramik and J. Rimanek, “Linear constraints with inexact data,” Izv. AN SSSR, Tech. Kibern., No. 2, 41–48 (1987).
D. Goldfarb and G. Iyengar, “Robust convex quadratically constrained programs,” Math. Program., No. 3, 135–141 (2003).
Author information
Authors and Affiliations
Additional information
__________
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 103–114, January–February 2007.
Rights and permissions
About this article
Cite this article
Semenova, N.V. Methods of searching for guaranteeing and optimistic solutions to integer optimization problems under uncertainty. Cybern Syst Anal 43, 85–93 (2007). https://doi.org/10.1007/s10559-007-0028-8
Received:
Issue Date:
DOI: https://doi.org/10.1007/s10559-007-0028-8