Authors:
Akhil Langer
and
Udatta Palekar
Affiliation:
University of Illinois at Urbana-Champaign, United States
Keyword(s):
Stochastic Optimization, Decomposition, Scenario-based Decomposition, Multicut L-shaped Method, Resource Allocation, US Military Aircraft Allocation.
Related
Ontology
Subjects/Areas/Topics:
Applications
;
Artificial Intelligence
;
e-Business
;
Enterprise Information Systems
;
Knowledge Discovery and Information Retrieval
;
Knowledge-Based Systems
;
Linear Programming
;
Logistics
;
Methodologies and Technologies
;
Operational Research
;
Optimization
;
Pattern Recognition
;
Resource Allocation
;
Scheduling
;
Software Engineering
;
Stochastic Optimization
;
Symbolic Systems
Abstract:
Stochastic program optimizations are computationally very expensive, especially when the number of scenarios are large. Complexity of the focal application, and the slow convergence rate add to its computational complexity. We propose a split-and-merge (SAM) method for accelerating the convergence of stochastic linear programs. SAM splits the original problem into subproblems, and utilizes the dual constraints from the subproblems to accelerate the convergence of the original problem. Our initial results are very encouraging, giving up to 58% reduction in the optimization time. In this paper we discuss the initial results, the ongoing and the future work.