References
G. Dantzig, Linear Programming and Extensions [Russian translation], Progress, Moscow (1966).
A. L. Soyster, “Convex programming with set-inclusive constraints and application to inexact linear programming,” Oper. Res.,21, 1154–1157 (1973).
J. E. Falk, “Exact solution of inexact linear programs,” Oper. Res.,24, 783–787 (1976).
S. G. Timokhin and A. V. Shapkin, “Linear programming problems with inexact data,” Ekon. Mat. Metody,17, No. 5, 955–963 (1981).
G. M. Agayan, A. A. Ryutin, and A. M. Tikhonov, “Linear programming problems with approximate data,” Zh. Vychisl. Matem. Mat. Fiziki,24, No. 9, 1303–1311 (1984).
A. A. Vatolin, “Linear programming problems with interval-valued coefficients,” Zh. Vychisl. Matem. Mat. Fiziki,24, No. 11, 1629–1637 (1984).
A. A. Vatolin, “Determination and interpretation of solutions in models with inexact information,” Ekon. Mat. Metody,29, No. 2, 285–293 (1993).
Ya. Ramik and I. Rimanek, “Linear constraints with inexact data,” Izv. Akad. Nauk SSSR, Tekhn. Kibern., No. 2, 41–48 (1987).
S. P. Sharyi, “An algebraic approach to the analysis of linear static systems with interval uncertainty,” in: Topical Issues of Computer Science, Applied Mathematics, and Mechanics [in Russian], VTs SO RAN, Krasnoyarsk (1995), pp. 331–354.
M. Libura, “Integer programming problems with inexact objective functions,”. Contr. Cyber.,9, No. 4, 189–202 (1980).
N. V. Semenova, “Solving one generalized integer programming problem,” Kibernetika, No. 5, 25–31 (1984).
I. V. Sergienko, V. A. Roshchin, and N. V. Semenova, “Solving inexact integer programming problems,” Dokl. Akad. Nauk UkrSSR, Ser. A, No. 12, 61–64 (1988).
V. A. Roshchin, N. V. Semenova, and I. V. Sergienko, “Solution and analysis of one class of inexact integer programming problems,” Kibernetika, No. 2, 42–47 (1989).
V. A. Roshchin, N. V. Semenova, and I. V. Sergienko, “Decomposition approach to solving some integer programming problems with inexact data,” Zh. Vychisl. Matem. Mat. Fiziki,29, No. 5, 786–791 (1990).
V. A. Roshchin, “Approximate solution of some integer programming problems with inexact data,” in: Numerical Methods and Development Technology for Application Software Packages [in Russian], Inst. Kibern. AN Ukr, Kiev (1990), pp. 4–8.
N. V. Semenova, “Decomposition approach to solving a class of integer programming problem with inexact data,” in: Optimization of Computations [in Ukrainian], abstracts of papers at a symposium (Kiev 22–24 Sept. 1993), Inst. Kibern. im. V. M. Glushkov, Kiev (1993), pp. 153–154.
V. A. Roshchin and I. V. Sergienko, “Solving integer programming problems with inexact data,” Kibern. Sist. Anal., No. 5, 45–51 (1994).
V. I. Levin, “Interval discrete programming,” Kibern. Sist. Anal., No. 6, 91–103 (1994).
Additional information
The study was partially supported by the Joint Foundation of the Government of Ukraine and International Scientific Foundation (grant No. K4C100).
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 75–86, November–December, 1995.
Rights and permissions
About this article
Cite this article
Sergienko, I.V., Semenova, N.V. Integer programming problems with inexact data: Exact and approximate solutions. Cybern Syst Anal 31, 842–851 (1995). https://doi.org/10.1007/BF02366621
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02366621