A Scalable Parallel Algorithm for Multiple Objective Linear Programs

Abstract

This paper presents an ADBASE-based parallel algorithms for solving multiple objective linear programs (MOLPs). 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 MOLPs, 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 MOLPs are also included.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1994
Accession Number
ADA283545

Entities

People

  • Hong Zhang
  • Malgorzata M. Wiecek

Tags

Communities of Interest

  • Human Systems
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computers
  • Contracts
  • Efficiency
  • Engineering
  • Evolutionary Algorithms
  • Linear Programming
  • Mathematical Programming
  • Multiobjective Optimization
  • Multiprocessors
  • Optimization
  • Parallel Computing
  • Parallel Processing
  • Parallel Processors
  • Systems Engineering

Fields of Study

  • Computer science

Readers

  • Operations Research
  • Parallel and Distributed Computing.
  • Systems Analysis and Design