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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE robotics and automation letters Vol. 5; no. 4; pp. 5051 - 5058
Main Authors:	Liu, An-Bang, Luh, Peter B., Bragin, Mikhail A., Yan, Bing
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 01.10.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!