Open Access
Research Article
A penalty method for linear programming
*Linda MennicheCorresponding authormennichelinda03@gmail.comDepartment of Mathematics LMPA Laboratory Mohamed Seddik Ben Yahia University BP 98, Ouled Aissa Jijel, 18000, AlgeriaView full profile → , Dj. Benterkidjbenterki@univ-setif.dzDepartment of Mathematics Laboratory of Fundamental and Numerical Mathematics (LMFN) Setif1 University-Ferhat AbbasDepartment of Mathematics Laboratory of Fundamental and Numerical Mathematics Ferhat Abbas UniversitySetif, 19000, AlgeriaView full profile → , Bachir Merikhibmerikhi@univ-setif.dzDepartment of Mathematics Laboratory of Fundamental and Numerical Mathematics (LMFN) Setif1 University-Ferhat AbbasSetif, 19000, AlgeriaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 06 Jul 2022
- Accepted:
- 02 Nov 2022
- Published Online:
- 27 Apr 2024
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-1340
- Pages:
- 677–685
Abstract
A logarithmic penalty method for linear optimization problem with a new approximate function is analyzed. The function addressed makes it possible to offer a displacement-step without major difficulties.We consider some numerical results which show the superiority of this approach versus line search methods.
Keywords
Subject Classifications
(2010) 90C2290C51
References
[1] A. Asadi, C. Roos, Infeasible Interior point methods for linear optimization based on large neighbourhood. Journal of Optimization Theory and Applications 170, 562-590 (2016).[2] L. B. Cherif, B. Merikhi, A penalty method for nonlinear programming, RAIRO-Operations Research, 53, 29-38 (2019).[3] 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, 411-426 (2008).[4] J.P. Crouzeix, B. Merikhi, A logarithm barrier method for semidefinite programming, RAIRO-Operations Research, 42, 123-139 (2008).[5] 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).[6] R.A.K. Frish, The logarithmic potential method of convex programming, Technical report, University Institute of Economics, Olso, Noway (1955).[7] N. Karmarkar, A new polynomial-time algorithm in linear programming, Combinatorica 4, 373-395 (1984).[8] A. Keraghel, Etude adaptative et comparative des principales variantes de l’algorithme de Karmarkar, (Thèse de Doctorat) Universit é Joseph Fourier, Grenoble, France, (1989).[9] 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, 87-96 (2001).[10] M. Kojima, N. Megiddo, S. Mizuno, A primal-dual infeasible interior point method for linear programming, Mathematical Programming 61, 263-280 (1993).[11] I.J. Lustig, Feasibility issues in a primal-dual interior point method for linear programming. Mathematical Programming 49, 145-162 (1990/1991).[12] L. Menniche, D. Benterki, A logarithmic barrier approach for linear programming, Journal of Computational and Applied Mathematics 312, 267-275 (2017).[13] L. Menniche, D. Benterki, I. Benchetta, An efficient logarithmic barrier method for linear programming, Journal of Information and Optimization Sciences 42(8), 1799-1813 (2021).[14] C. Roos, A ful-Newton step o(n) infeasible interior point algorithm for linear optimization. SIAM Journal on Optimization 6, 1110-1136 (2006).[15] A. Zaarat, S. Radjef, Adaptative method for linear programming problems with hybrid variables, Journal of Information and Optimization Sciences 42(3), 513-531 (2021).
Views: 152Downloads: 10Citations: 0
