A decentralized coordination algorithm for multi-objective linear programming with block angular structure

Evans Sowah Okpoti, In Jae Jeong

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

This article considers linear multi-objective programming problems with block angular structure, which are analogous to multi-disciplinary optimization environments where disciplines must collaborate to achieve a common overall goal. In this decentralized environment, a mechanism to guide locally optimized decision makers’ solutions to a Pareto-optimal solution without sharing the entire local information is developed. The mechanism is based on an augmented Lagrangian approach to generate a solution and is separated into two phases: phase I determines an ideal point for each of the single objectives and phase II searches for a compromise solution starting from a single ideal point. Theoretical results show that the algorithm converges and the solution generated is Pareto optimal. The algorithm’s effectiveness is demonstrated via an illustrative example and a real-world bi-objective re-entrant flow-shop production planning problem. The real-world experimental results showed that the decentralized method had an average 50% better performance compared to other centralized methods.

Original languageEnglish
Pages (from-to)185-205
Number of pages21
JournalEngineering Optimization
Volume53
Issue number2
DOIs
StatePublished - 2021

Keywords

  • Collaborative optimization
  • block angular structure
  • decentralized coordination
  • multi-agent
  • multi-objective linear programming

Fingerprint Dive into the research topics of 'A decentralized coordination algorithm for multi-objective linear programming with block angular structure'. Together they form a unique fingerprint.

Cite this