An algorithm for solving a min-max problem by adaptive method Online publication date: Mon, 02-Oct-2023
by Aghiles Azizen; Kahina Louadj; Mohamed Aidene
International Journal of Mathematics in Operational Research (IJMOR), Vol. 26, No. 1, 2023
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Mathematics in Operational Research (IJMOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook