Branch-and-cut for piecewise linear optimization

Simple item page
dc.contributor.committeeChairFarias, Ismael R. d.
dc.contributor.committeeMemberSimonton, James L.
dc.contributor.committeeMemberMatis, Timothy I.
dc.contributor.committeeMemberSmith, Phillip
dc.contributor.committeeMemberZhang, Yuanlin
dc.creatorRajat, Gupta
dc.date.accessioned2016-11-14T23:32:03Z
dc.date.available2012-06-25T21:12:04Z
dc.date.available2016-11-14T23:32:03Z
dc.date.issued2012-05
dc.degree.departmentIndustrial Engineering
dc.description.abstractIn this research we report and analyze the results of our extensive testing of branch-and- cut for piecewise linear optimization using the cutting planes. We tested large instances for transshipment problem using MIP, LOG and SOS2 formulations. Besides analysis of the performance of the cuts, we also analyze the effect of formulation of the performance of branch-and-cut. These tests were conducted using callable libraries of CPLEX and GUROBI. Finally, we also analyzed the results of piecewise linear optimization problems with semi- continuous constraints.
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/2346/45270
dc.language.isoeng
dc.rights.availabilityUnrestricted.
dc.subjectPiecewise linear topology
dc.subjectCombinatorial optimization
dc.subjectMathematical optimization
dc.subjectOperations research
dc.subjectBranch-and-cut
dc.subjectLinear programming
dc.subjectInteger programming
dc.titleBranch-and-cut for piecewise linear optimization
dc.typeDissertation

Files

Collections

Texas Tech University