Show simple item record

dc.contributor.advisorLee, Eva
dc.contributor.authorShapoval, Andriy
dc.date.accessioned2015-06-08T18:15:23Z
dc.date.available2015-06-09T05:30:07Z
dc.date.created2014-05
dc.date.issued2014-04-09
dc.date.submittedMay 2014
dc.identifier.urihttp://hdl.handle.net/1853/53460
dc.description.abstractThis work contributes to modeling, theoretical, and practical aspects of structured Mathematical Programming problems. Many real-world applications have nonlinear characteristics and can be modeled as Mixed Integer Nonlinear Programming problems (MINLP). Modern global solvers have significant difficulty handling large-scale instances of them. Several convexification and underestimation techniques were proposed in the last decade as a part of the solution process, and we join this trend. The thesis has three major parts. The first part considers MINLP problems containing convex (in the sense of continuous relaxations) and posynomial terms (also called monomials), i.e. products of variables with some powers. Recently, a linear Mixed Integer Programming (MIP) approach was introduced for minimization the number of variables and transformations for convexification and underestimation of these structured problems. We provide polyhedral analysis together with separation for solving our variant of this minimization subproblem, containing binary and bounded continuous variables. Our novel mixed hyperedge method allows to outperform modern commercial MIP software, providing new families of facet-defining inequalities. As a byproduct, we introduce a new research area called mixed conflict hypergraphs. It merges mixed conflict graphs and 0-1 conflict hypergraphs. The second part applies our mixed hyperedge method to a linear subproblem of the same purpose for another class of structured MINLP problems. They contain signomial terms, i.e. posynomial terms of both positive and negative signs. We obtain new facet-defining inequalities in addition to those families from the first part. The final part is dedicated to managing guest flow in Georgia Aquarium after the Dolphin Tales opening with applying a large-scale MINLP. We consider arrival and departure processes related to scheduled shows and develop three stochastic models for them. If demand for the shows is high, all processes become interconnected and require a generalized model. We provide and solve a Signomial Programming problem with mixed variables for minimization resources to prevent and control congestions.
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.publisherGeorgia Institute of Technology
dc.subjectDiscrete optimization
dc.titleTopics in linear and nonlinear discrete optimization
dc.typeDissertation
dc.description.degreePh.D.
dc.contributor.departmentIndustrial and Systems Engineering
dc.embargo.terms2015-05-01
thesis.degree.levelDoctoral
dc.contributor.committeeMemberJohnson, Ellis
dc.contributor.committeeMemberPokutta, Sebastian
dc.contributor.committeeMemberGoldsman, David M.
dc.contributor.committeeMemberWu, D. J.
dc.date.updated2015-06-08T18:15:23Z


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record