Ordinal-Optimization Concept Enabled Decomposition and Coordination of Mixed-Integer Linear Programming Problems

Many important optimization problems, such as manufacturing scheduling and power system unit commitment, are formulated as Mixed-Integer Linear Programming (MILP) problems. Such problems are generally difficult to solve because of their combinatorial nature, and may subject to strict computation tim...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE robotics and automation letters Jg. 5; H. 4; S. 5051 - 5058
Hauptverfasser:	Liu, An-Bang, Luh, Peter B., Bragin, Mikhail A., Yan, Bing
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 01.10.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Combinatorial analysis Complexity theory Computing time Convergence Coordination Decomposition Generalized assignment problems (GAPs) Integer programming Integers Linear programming Linearity Manufacturing Mathematical programming Mixed integer linear programming Mixed-integer linear programming (MILP) Optimization Ordinal optimization (OO) Planning Scheduling and Coordination Surrogate absolute-value Lagrangian relaxation (SAVLR) Unit commitment
ISSN:	2377-3766, 2377-3766
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!