A scalable parallel algorithm for multiple objective linear programs
- Author:
- Zhang, Hong
- Published:
- Jun 1, 1994.
- Physical Description:
- 1 electronic document
- Additional Creators:
- Wiecek, Malgorzata M.
Online Version
- hdl.handle.net , Connect to this object online.
- Restrictions on Access:
- Unclassified, Unlimited, Publicly available.
Free-to-read Unrestricted online access - Summary:
- This paper presents an ADBASE-based parallel algorithm for solving multiple objective linear programs (MOLP's). Job balance, speedup and scalability are of primary interest in evaluating efficiency of the new algorithm. Implementation results on Intel iPSC/2 and Paragon multiprocessors show that the algorithm significantly speeds up the process of solving MOLP's, which is understood as generating all or some efficient extreme points and unbounded efficient edges. The algorithm gives specially good results for large and very large problems. Motivation and justification for solving such large MOLP's are also included.
- Other Subject(s):
- Collection:
- NASA Technical Reports Server (NTRS) Collection.
- Note:
- Document ID: 19940033028.
Accession ID: 94N37539.
NASA-CR-194920.
AD-A283545.
ICASE-94-38.
NAS 1.26:194920. - Terms of Use and Reproduction:
- No Copyright.
View MARC record | catkey: 15657521