Literature Cited
V. J. Bowman Jr., “Sensitivity analysis in linear integer programming,” AIIE Tech. Papers (1972) (Reprint).
R. E. Jensen, “Sensitivity analysis and integer linear programming,” Accounting Rev., 43, No. 3 (1968).
H. Noltemeier, Sensitivitätsanalyse bei Diskreten Linearen Optimierungsproblem, Springer, Berlin (1970).
G. M. Roodman, “Postoptimality analysis in zero-one programming by implicit enumeration,” Naval Res. Log. Q., 19, No. 3, (1972).
G. M. Roodman, “Postoptimality analysis in integer programming by implicits enumeration: the mixed integer case,” Naval Res. Log. Q., 21, No. 4, (1974).
J. Travnicek, “Parametric zero-one programming with parametrized objective function,” Ekonomicko-Mat. Obzor, 8, No. 4 (1972).
C. J. Piper and A. A. Zoltners, “Implicit enumeration based algorithms for postoptimizing zero-one programs,” Management Science Research Report No. 313, Carnegie-Mellon Univ. (1973).
J. Hrouda, “The Benders method and Parametrization of the right-hand sides in the mixed integer linear programming problem,” Aplicace Mat., 21, No. 5 (1976).
T. T. Lebedeva and I. V. Sergienko, “Method of directional neighborhoods,” Dokl. Akad. Nauk Ukr. SSR, No. 8 (1978).
G. Zoutendijk, Methods of Feasible Directions, Elsevier, Amsterdam (1960).
T. T. Lebedeva, “Algorithm for integer solutions of a system of linear equations and inequalities,” in: Structure and Organization of Software Packages [in Russian], Kiev (1978).
Additional information
Translated from Kibernetika, No. 5, pp. 91–94, September–October, 1979.
Rights and permissions
About this article
Cite this article
Filonenko, N.V. Approximate solution of parametric integer programming problems. Cybern Syst Anal 15, 703–707 (1979). https://doi.org/10.1007/BF01071222
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01071222