Abstract
We give a formulation of an integer programming problem with inexact constraint matrix coefficients and an inexact objective function. An approach to solution and investigation of such inexact integer programming problems is proposed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
G. Dantzig, Linear Programming and Extensions, Princeton Univ. Press (1963).
A. A. Pervozvanskii, Mathematical Models in Industrial Management [in Russian], Nauka, Moscow (1975).
S. G. Timokhin and A. V. Shapkin, “On linear programming problems with inexact data,” Ékon. Mat. Metody,17, No. 5, 955–963 (1981).
A. L. Soyster, “A duality theory for convex programming with set inclusive constraints,” Oper. Res.,22, No. 4, 892–898 (1974).
M. Libura, “Integer programming problems with inexact objective function,” Contr. Cybern.,9, No. 4, 189–202 (1980).
N. V. Semenov, “Solution of one generalized integer programming problem,” Kibernetika, No. 5, 25–31 (1984).
Additional information
Translated from Kibernetika, No. 2, pp. 42–46, 64, March–April, 1989.
Rights and permissions
About this article
Cite this article
Roshchin, V.A., Semenova, N.V. & Sergienko, I.V. Solution and investigation of one class of inexact integer programming problems. Cybern Syst Anal 25, 185–193 (1989). https://doi.org/10.1007/BF01070127
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01070127