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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H.P. Benson, "An all-linear programming relaxation algorithm for optimizing over the efficient set," Journal of Global Optimization, vol. 1, pp. 83–104, 1991.
—, "A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set," Journal of Optimization Theory and Applications, vol. 73, pp. 47–64, 1992.
H.P. Benson and S. Sayin, "A face search heuristic algorithm for optimizing over the efficient set," Naval Research Logistics, vol. 40, pp. 103–116, 1993.
C.S. Chang, "Co-ordinated static and dynamic monitoring and optimization of power systems using a parallel architecture and pattern recognition techniques," IEE Proceedings-C, vol. 139, pp. 197–204, 1992.
V. Chankong and Y.Y. Haumes, Multiobjective Decision Making-Theory and Methodology, North-Holland: New York, 1983.
J.N. Climaco, J.P. Costa, C. Antunes, and M.J. Alves, "Parallel processing in MOLP method base development-Discussion using two case studies," Paper Presented at the IXth International Conference on Multiple Criteria Decision Making, Faurfax, VA, 1990.
J.P. Costa and J.N. Climaco, "A multiple reference point parallel approach in MCDM," Proceedings of the Tenth International Conference on Multiple Criteria Decision Making, Taupei, 1992, vol. 3, pp. 265–272.
S. Dutt and N. Mahapatra, "Scalable load-balancing strategies for parallel A* algorithms," Journal of Parallel and Distr. Computing, vol. 22, pp. 488–505, 1994.
Y. Evtushenko, V. Mazourik, and V. Ratkin, "Multicriteria optimization in the DISO system," Optimization, Parallel Proceesing and Application, A. Kurzhanski, K. Neumann, and D. Pallaschke (Eds.), Springer-Verlag: Berlin, pp. 94–102, 1988.
M. Grauer and H. Boden, "Opportunities on parallel and distributed computation for optimization and decision support," Proceedings of the Tenth International Conference on Multiple Criteria Decision Making, Taupei, 1992, vol. 1, pp. 197–207.
V. Kumar and G. Ananth, "Parallel algorithms for discrete optimization problems," Math. Programming Soc. Comm. Alg. Bul., vol. 21, pp. 8–12, 1992.
V. Kumar, A. Grama, A. Gupta, and G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin/Cummings: Redwood City, CA, 1994.
V. Kumar, K. Ramesh, and V. Nageshwara Rao, "Parallel best-first search of state-space graphs: A summary of results," Proceedings of the AAAU-88 Seventh National Conference on Artificial Intelligence, St. Paul, MN, 1988.
A. Lewandowski, "Parallel implementation of selected MCDM algorithms," Paper presented at the TIMS/ORSA Joint National Meeting, Chicago, 1993.
N. Mahapatra and S. Dutt, Scalable Global and Local Hashing Strategies for Duplicate Pruning in Parallel A* Graph Search, IEEE Trans. Parallel and Distr. Systems (to appear).
W.Y. Ng and J. Yang, "Interactive sampling of efficient frontier in multi-objective programming by parallel distributed computation," Proceedings of the Tenth International Conference on Multiple Criteria Decision Making, Taupei, 1992, vol. 2, pp. 325–334.
R.E. Steuer, Multiple Criteria Optimization-Theory, Computation and Application, John Willy: New York, 1986.
—, "Manual for the ADBASE multiple objective linear programming package," Department of Management Science and Information Technology, University of Georgia, Athems, GA, 1991.
—, "Random problem generation and the computation of efficient extreme points in multiple objective linear programming," Computational Optimization and Applications, vol. 3, pp. 333–347, 1994.
X. Sun and J. Gustafson, "Toward a better parallel performance metric," Parallel Computing, vol. 17, pp. 1093–1109, 1991.
X. Sun and D. Rover, "Scalability of parallel algorithm-machine combinations," IEEE-TPDS, pp. 599–613, 1994.
H. Zhang and M.M. Wiecek, "Solving multiple objective linear programs on the Intel Paragon," Toward Tera-flop Computing and New Grand Challenge Applications, R.K. Kalia and P. Vashishta (Eds.), Nova Science Publishers, New York, pp. 323–329, 1995.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wiecek, M.M., Zhang, H. A Parallel Algorithm for Multiple Objective Linear Programs. Computational Optimization and Applications 8, 41–56 (1997). https://doi.org/10.1023/A:1008606530836
Issue Date:
DOI: https://doi.org/10.1023/A:1008606530836