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

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.