A bookkeeping strategy for multiple objective linear programs

This paper discusses bookkeeping strategies for solving large multiple objective linear programs (MOLPs) on ADBASE, a popular sequential software package, and on a parallel ADBASE algorithm. Three representative list creation schemes were first analysed and tested. The best of them, Binary Search with Insertion Sort, was incorporated into ADBASE and the parallel ADBASE algorithm. These revised versions were compared with their standard counterparts on a series of test problems, and their computation times were compared. The results show that the new bookkeeping strategy for maintaining a list of efficient solutions significantly speeds up the process of solving MOLPs, especially on parallel computers.