 An algorithm for solving a min-max problem by adaptive methodAghiles Azizen, Kahina Louadj and Mohamed Aidene International Journal of Mathematics in Operational Research, 2023, vol. 26, issue 1, 96-110 Abstract: Min-max problems occupies an important place in linear programming (LP), as it addresses a large number of optimisation problems, in various fields of science. In this study, an algorithm using adaptive method is proposed for solving the min-max problem in linear programming. It consists on finding the maximum of the minimum of a function (where the essential constraints are in equality and the direct constraints are bounded) in a minimum execution time. A solving algorithm is built using the principle of the adaptive method and it is based on the concept of the support matrix of the problem. Necessary and sufficient conditions for the optimality of a support feasible solution are established and sub-optimality criterion is derived. This algorithm allows to solve directly the considered problem, without modifying it and avoids the drawbacks of the increase in the number of the variables and the constraints, thus, improve the convergence speed of the method. Its performance is tested on a numerical example. Keywords: min-max problem; linear programming; adaptive method; sub-optimality estimate; change of support; optimisation; feasible solution; optimality criterion. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:26:y:2023:i:1:p:96-110 Access Statistics for this article More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.