Irreducible Infeasible Subsystem Decomposition for Probabilistically Constrained Stochastic Integer Programs

This dissertation explores methods for finding irreducible infeasible subsystems (IISs) of systems of inequalities with binary decision variables and for solving probabilistically constrained stochastic integer programs (SIP-C). Finding IISs for binary systems is useful in decomposition methods for...

Full description

Bibliographic Details
Main Author: Gallego Arrubla, Julian Andres
Other Authors: Ntaimo, Lewis
Format: Others
Language:en
Published: 2013
Subjects:
Online Access:http://hdl.handle.net/1969.1/151296