A Parallel Algorithm for Multiple Objective Linear Programs

Authors:
Malgorzata M. Wiecek;Hong Zhang
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson, SC 29634-1907, U.S.A./ E-mail: wmalgor@clemson.edu, hongsu@math.clemson.edu;Department of Mathematical Sciences, Clemson University, Clemson, SC 29634-1907, U.S.A./ E-mail: wmalgor@clemson.edu, hongsu@math.clemson.edu
Venue:
Computational Optimization and Applications
Year:
1997

Citing 6
Cited 1

A finite nonadjacent extreme-point search algorithm for optimization over the efficient set

Journal of Optimization Theory and Applications
Introduction to parallel computing: design and analysis of algorithms

Introduction to parallel computing: design and analysis of algorithms
Scalable load balancing strategies for parallel A* algorithms

Journal of Parallel and Distributed Computing - Special issue on scalability of parallel algorithms and architectures
Random problem generation and the computation of efficient extreme points in multiple objective linear programming

Computational Optimization and Applications - Special issue dedicated to George Dantzig
Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel A* Graph Search

IEEE Transactions on Parallel and Distributed Systems
Scalability of Parallel Algorithm-Machine Combinations

IEEE Transactions on Parallel and Distributed Systems

Parallel Approaches for Multiobjective Optimization

Multiobjective Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an ADBASE-based parallel algorithm forsolving multiple objective linear programs (MOLPs). Job balance,speedup and scalability are of primary interest in evaluatingefficiency of the new algorithm. The scalability of a parallelalgorithm is a measure of its capacity to increase performance withrespect to the number of processors used. Implementation results onIntel iPSC/2 and Paragon multiprocessors show that the algorithmsignificantly speeds up the process of solving MOLPs, which isunderstood as generating all or some efficient extreme points andunbounded efficient edges. The algorithm is shown to be scalable andgives better results for large problems. Motivation andjustification for solving large MOLPs are also included.