This is a preview of subscription content, log in via an institution to check access.
Literature Cited
V. K. Leont'ev, “Stability in linear discrete problems,” Probl. Kibern., No. 35, 169–184 (1979).
A. M. Geoffrion and R. Nauss, “Parametric and postoptimality analysis in integer linear programming,” Manage. Sci.,21, No. 5, 453–466 (1977).
G. M. Roodman, “Postoptimality analysis in zero-one programming by implicit enumeration,” Naval Res. Logistic Q.,19, No. 3, 435–447 (1972).
G. M. Roodman, “Postoptimality analysis in integer programming by implicit enumeration: the mixedinteger case,” Naval Res. Logistic Q.,21, No. 4, 595–607 (1974).
C. J. Piper and A. A. Zoltners, “Some easy postoptimality analysis for zero-one programming,” Manage. Sci.,22, No. 7, 759–765 (1976).
C. J. Piper and A. A. Zoltners, “Implicit enumeration based algorithms for postoptimizing zero-one programs,” Naval Res. Logistic Q.,22, No. 4, 791–809 (1975).
C. R. Frank, “Parametric programming in integers,” Oper. Res. Verfahren, No. 3, 167 (1967).
S. Holm and D. Klein, “Discrete right-hand side parametrization for linear integer programs,” European J. Oper. Res.,2, No. 1, 50–53 (1978).
D. Klein and S. Holm, “Integer programming postoptimal analysis with cutting planes,” Manage. Sci.,25, No. 1, 64–72 (1979).
M. G. Baily and B. E. Gillet, “Parametric integer programming analysis: a contraction approach,” J. Oper. Res. Soc.,31, No. 3, 257–262 (1980).
B. Bank, “Qualitative Stabilität-suntersuchungen rein- und gemischt-ganzzahliger linearer parametrischer Optimierungsprobleme,” Seminarber. Humboldt-Univ., Berlin, Sec. Math.,14, No. 6 (1978).
B. Bank, “Stability analysis in pure and mixed integer programming,” Lect. Notes Control Inf. Sci., No. 23, 148–153 (1980).
L. N. Kozeratskaya, “On system of parametric linear Diophantine equations,” Dokl. Akad. Nauk Ukr, SSR, No. 9, 11–14.
L. N. Kozeratskaya and N. V. Chernikova, “Investigation of one class of parametric problems of discrete programming,” in: Abstracts of Papers of the Scientific-Theoretical Conf. “Methods of Mathematical Programming and Their Software” [in Russian], Sverdlovsk (1981), pp. 70–71.
Yu. Yu. Finkel'shtein, Approximate Methods and Applied Problems in Discrete Programming [in Russian], Nauka, Moscow (1976).
I. V. Sergienko, T. T. Lebedeva, and V. A. Roshchin, Approximate Methods of Solution of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1980).
I. V. Sergienko, T. T. Lebedeva, and I. V. Filonenko, “Approximate solution of integer programming problems with a parameter in constraints,” in: Computational Aspects in Application Program Packages [in Russian], Kiev (1980), pp. 3–7.
I. V. Filonenko, “Approximate solution of integer parametric programming problems,” Kibernetika, No. 5, 91–94 (1979).
J. Hrouda, “The Benders method and parametrization of the right-hand sides in mixed-integer linear programming,” Appl. Math., No. 21, 327–364 (1976).
Additional information
Translated from Kibernetika, No. 3, pp. 80–84, May–June, 1982.
Rights and permissions
About this article
Cite this article
Sergienko, I.V., Kozeratskaya, L.N. Solution of a parametric integer programming problem. Cybern Syst Anal 18, 360–367 (1982). https://doi.org/10.1007/BF01069764
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01069764