Abstract
Algorithmic solutions of parametric problems of two types with a parameter in the objective function and with a parameter in the system of constraints are considered in a Euclidean combinatorial set of combinations with repetitions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. V. Sergienko, L. N. Kozeratskaya, and T. T. Lebedeva, Stability and Parametric Analysis of Discrete Optimization Problems [in Russian], Naukova Dumka, Kiev (1995).
I. V. Sergienko, L. N. Kozeratskaya, and A. A. Kononova, “Stability and unboundedness of vector-optimization problems.” Kibern. Sist. Anal., No. 1, 3–10 (1997).
L. N. Kozeratskaya, T. T. Lebedeva, and I. V. Sergienko, “Stability of discrete-optimization problems,” Kibern. Sist. Anal., No. 3, 78–93 (1993).
L. N. Kozeratskaya, T. T. Lebedeva, and I. V. Sergienko, “Problems of stability and parametric and postoptimal analysis of discrete-optimization problems,” Kibernetika, No. 4, 71–80 (1983).
L. N. Kozeratskaya, T. T. Lebedeva, and I. V. Sergienko, “Discrete-optimization problems: Stability analysis,” Obozr. Prikl. Prom. Mat., No. 1, 12–30 (1995).
L. N. Kozeratskaya, Integer Optimization Problems: Stability Problems and Parametric Analysis [in Ukrainian], Author’s Abstract of Doctoral Dissertation, Kiev (1997).
V. A. Emelichev and R. A. Berdysheva, “Radii of pseudostability, quasistability, and stability of the vector trajectory problem of lexicographic optimization,” Diskret. Mat., 10, No. 1, 20–27 (1998).
V. A. Emelichev and M. K. Kravtsov, “Stability in vector optimization path problems” Kibern. Sist. Anal., No. 4, 137–143 (1995).
V. K. Leont’ev, “Stability in linear discrete problems,” Probl. Kibern., No. 35, 169–184 (1979).
E. N. Gordeev and V. K. Leont’ev, “Trajectory parametric problems,” Zh. Vychisl. Mat. Mat. Fiz., 24, No. 1, 37–46 (1984).
E. N. Gordeev and V. K. Leont’ev, “The general approach to the analysis of the stability of discrete-optimization problems,” Zh. Vychisl. Mat. Mat. Fiz., 36, No. 1, 66–72 (1996).
Yu. G. Stoyan and O. A. Yemets, Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], ISDO, Kiev (1993).
O. A. Yemets, Theory and Methods of Combinatorial Optimization in Euclidean Sets in Geometric Designing [in Ukrainian], Author’s Abstract of Doctoral Dissertation, Kiev (1997).
O. A. Yemets, Euclidean Combinatorial Sets and Optimization on Them. Advances in Mathematical Programming: A Textbook [in Russian], UMK VO, Kiev (1992).
O. S. Pichugina, Methods and Algorithms of Solution of Some Optimization Problems on Sets of Combinations and Permutations, Author’s Thesis, HDTURE, Khar’kov (1996).
M. Aigner, Combinatorial Theory [Russian translation], Mir, Moscow (1982).
V. I. Baranov and B. S. Stechkin, Extremal Combinatorial Problems and Their Application, Nauka, Moscow (1989).
Author information
Authors and Affiliations
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 160–165, November–December, 1999.
Rights and permissions
About this article
Cite this article
Yemets, O.A., Roskladka, A.A. Algorithmic soluyion of two parametric optimization problems on a set of complete combinations. Cybern Syst Anal 35, 981–986 (1999). https://doi.org/10.1007/BF02742292
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02742292