Parametric linear programming : The case of parameterized objective function
*Stefan M. StefanovCorresponding authorstefm@swu.bgDepartment of InformaticsNeofit Rilski South-West UniversityBlagoevgrad, 2700, BulgariaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Nov 2024
- Published Online:
- 12 Mar 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-1962
- Pages:
- 1–9
Abstract
Keywords
Subject Classifications
References
[1] I. Adler and R. Monteiro, “A geometric view of parametric linear programming”, Algorithmics, vol. 8, pp. 161-176 (1992).
[2] J. F. Bonnans and A. Shapiro, Perturbation Analysis of Optimization Problems, Springer Series in Operations Research, Springer-Verlag, New York (2000).
[3] T. Gal and H. J. Greenberg, Advances in Sensitivity Analysis and Parametric Programming, Kluwer Academic Publishers, Norwell, Massachusetts (1997).
[4] A. G. Hadigheh and T. Terlaky, “Generalized support set invariancy sensitivity analysis in linear optimization”, Journal of Industrial and Management Optimization, vol. 2, pp. 1-18 (2006).
[5] A. Ghaffari-Hadigheh, Ghaffari-Hadigheh, and T. Terlaky, “Bi-parametric optimal partition invariancy sensitivity analysis in linear optimization”, Central European Journal of Operations Research, vol. 16, no. 2, pp. 215-238 (2008).
[6] A. G. Hadigheh, K. Mirnia, and T. Terlaky, “Active constraint set invariancy sensitivity analysis in linear optimization”, Journal of Optimization Theory and Applications, vol. 133, no. 3, pp. 303-315 (2007).
[7] A. G. Hadigheh and T. Terlaky, “Sensitivity analysis in linear optimization: Invariant support set intervals”, European Journal of Operational Research, vol. 169, no. 3, pp. 1158-1175 (2006).
[8] B. Jansen, J. J. de Jong, C. Roos, and T. Terlaky, “Sensitivity analysis in linear programming: Just be careful!”, European Journal of Operational Research, vol. 101, no. 1, pp. 15-28 (1997).
[9] S. M. Stefanov, Convex Separable Programming: Theory and Methods, Kluwer Academic Publishers, Dordrecht-Boston-London (2000).
[10] S. M. Stefanov, “Well-posedness and primal-dual analysis of some convex separable optimization problems”, Advances in Operations Research, vol. 2013, 10 pages (2013) Article ID 279030.
[11] S. M. Stefanov, Separable Programming: Theory and Methods, 4th rev. enld. ed., Springer Science+Business Media, B.V., Dordrecht (2016).
[12] S. M. Stefanov, Separable Optimization: Theory and Methods, Springer Optimization and Its Applications, vol. 177, Springer, Cham (2021).
[13] S. M. Stefanov, “Continuous linear knapsack problems revisited”, Journal of Information and Optimization Sciences, vol. 44, no. 5, pp. 909-922 (2023).
[14] S. M. Stefanov, “On the dual simplex method”, Journal of Information and Optimization Sciences, to appear.
[15] O. Stein, Grundzüge der Parametrischen Optimierung, Springer, Berlin (2021).
