On the dual simplex method
*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 Oct 2024
- Published Online:
- 09 May 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-1954
- Pages:
- 1–11
Abstract
Keywords
Subject Classifications
References
[1] G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton (1963).
[2] G. B. Dantzig, and M. N. Thapa, Linear Programming, Vol. 1 - Introduction, Springer-Verlag, New York (1997).
[3] G. B. Dantzig, and M. N. Thapa, Linear Programming, Vol. 2 - Theory and Extensions, Springer-Verlag, New York (2003).
[4] G. Hristov, R. Kaltinska, Mathematical Programming, Part 1 - Linear Programming, Nauka and Izkustvo, Sofia (1972) (in Bulgarian).
[5] S. M. Stefanov, Separable Programming: Theory and Methods, Applied Optimization, Vol. 53, Kluwer Academic Publishers, Dordrecht-Boston-London (2001).
[6] S. M. Stefanov, “Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear equality constraint and bounds on the variables”, Applied Mathematics Research Express AMRX, vol. 2006, no. 4, pp. 1-24, Article ID 36581 (2006).
[7] S. M. Stefanov, “Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints”, Journal of Interdisciplinary Mathematics, vol. 12, no. 5, pp. 647-673 (2009).
[8] S. M. Stefanov, “Solution of some convex separable resource allocation and production planning problems with bounds on the variables”, Journal of Interdisciplinary Mathematics, vol. 13, no. 5, pp. 541-569 (2010).
[9] S. M. Stefanov, “On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory”, Mathematical Problems in Engineering, vol. 2014, pp. 10, Article ID 165701 (2014).
[10] S. M. Stefanov, “Strictly convex separable optimization with linear equality constraints and bounded variables”, Journal of Statistics and Management Systems, vol. 21, no. 2, pp. 261-272 (2018).
[11] S. M. Stefanov, “Characterization of the optimal solution of the convex separable continuous knapsack problem and related problems”, Journal of Information and Optimization Sciences, vol. 42, no. 1, pp. 1-16 (2021).
[12] S. M. Stefanov, Separable Optimization: Theory and Methods, Springer Optimization and Its Applications, vol. 177, Springer, Cham (2021).
[13] S. M. Stefanov, “On the solution of quadratic programming problems”, Journal of Information and Optimization Sciences, vol. 44, no. 2, pp. 243-253 (2023).
[14] S. M. Stefanov, “Continuous linear knapsack problems revisited”, Journal of Information and Optimization Sciences, vol. 44, no. 5, pp. 909-922 (2023).
[15] S. M. Stefanov, “Numerical solution of box constrained separable convex quadratic programming problems”, Journal of Information and Optimization Sciences, vol. 45, no. 1, pp. 57-71 (2024).
[16] S. M. Stefanov, “Linear programming problems and matrix games”, Journal of Interdisciplinary Mathematics, vol. 27, no. 1, pp. 57-65 (2024).
[17] S. M. Stefanov, “On the solution of two-person zero-sum matrix games”, Journal of Information and Optimization Sciences, vol. 45, no. 3, pp. 649-657 (2024).
[18] H. A. Taha, Operations Research: An Introduction, 10th ed., Pearson Education, London (2017).
[19] P. Yu Zaichenko, Operations Research, Slovo, Kiev (in Russian) (2003).
[20] S. I. Zuhovitskii, L. I. Avdeeva, Linear and Convex Programming, Nauka, Moscow (in Russian) (1967).
