On efficient solutions to bi-objective max-linear programming problems

Abdulhadi Aminu, Sunday E. Olowo and Salisu Usaini

International Journal of Mathematics in Operational Research, 2025, vol. 31, issue 3, 339-371

Abstract: A number of methods for determining solutions to max-linear programming problems with one objective function have been developed. In this work, we introduce the concept of a bi-objective max-linear programming problem subject to two sided constraints (BOMLP) for both minimisation and maximisation cases, then we proposed two methods for determining efficient solutions to the problem and developed improved algorithms based on an alternating and bisecting method of solving two sided max-linear system. Performance of the methods were compared based on effectiveness, user friendliness and task time, in fact the second method is found to be faster than the first method, some numerical examples were considered to test the problems using MATLAB software.

Keywords: bi-objective max-linear programming; two-sided system; optimal solution; efficient solution; pseudo-polynomial algorithms. (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=147859 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmore:v:31:y:2025:i:3:p:339-371

Access Statistics for this article

More articles in International Journal of Mathematics in Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().