References
- J.P. Crouzeix, A. Seeger, New bounds for the extreme values of a finite sample of real numbers, Journal of Mathematical Analysis and Applications, 197 (2008) 411–426. doi: https://doi.org/10.1006/jmaa.1996.0029
- J.P. Crouzeix, B. Merikhi, A logarithm barrier method for semidefinite programming, RAIRO-Operations Research, 42 (2008) 123–139. doi: https://doi.org/10.1051/ro:2008005
- A.V. Fiacco, G.P. McCormick, Nonlinear programming: Sequential unconstrained minimization techniques, Wiley Reprinted as volume 4 of SIAM Classics in Applied Mathematics Series, (1990).
- R.A.K. Frish, The logarithmic potential method of convex programming, Technical report, University Institute of Economics, Olso, Noway (1955).
- M. Irfan Ali, N. Mehmood, J. Zhan & N. Shah, Softlinearprogramming: An application of soft vector spaces, Journal of Information and Optimization Sciences, 41(3) (2020) 679-704. doi: https://doi.org/10.1080/02522667.2018.1551114
- N. Karmarkar, A new polynamial-time algorithm in linear programming, Combinatorica 4 (1984) 373–395. doi: https://doi.org/10.1007/BF02579150
- A. Keraghel, D. Benterki, Sur les performances de l’algorithme de Karmarkar pour la programmation linéaire, Revue Roumaine des sciences techniques mécaniques appliquées, 46 (2001) 87–96.
- A. Leulmi, S. Leulmi, Logarithmic barrier method via minorant function for linear programming, Journal of Siberian Federal University. Mathematics and Physic, 2(2) (2019) 91–201.
- L. Menniche, D. Benterki, A logarithmic barrier approach for linear programming, Journal of computational and Applied Mathematics 312 (2017) 267–275. doi: https://doi.org/10.1016/j.cam.2016.05.025
- S. Suneela & S. Chakraverty, New ranking function for fuzzy linear programming problem and system of linear equations, Journal of Information and Optimization Sciences, 40(1) (2019) 141-156. doi: https://doi.org/10.1080/02522667.2018.1450196