Show simple item record

dc.contributor.authorSen, Suvrajeeten
dc.date.accessioned2017-11-09T21:42:07Zen
dc.date.available2017-11-09T21:42:07Zen
dc.date.issued1982en
dc.identifier.urihttp://hdl.handle.net/10919/80269en
dc.description.abstractThis dissertation deals with a class of nonconvex mathematical programs called Extreme Point Mathematical Programs (EPMP). These problems are generalizations of certain Integer Programming problems and also find their application in other nonconvex programs like the Concave Minimization problem. The research addresses the design and analysis of algorithms for EPMP. However, most of the ideas are quite general and apply to a wider class of mathematical programs including the Generalized Lattice Point Problem. We obtain a variety of cutting plane algorithms and analyze the convergence of such algorithms. Insightful examples of nonconvergence are also provided. Two finitely convergent algorithms are also presented. One of these is a cutting plane based procedure while the other is a branch and bound scheme. Computational experience with both algorithms is given.en
dc.format.extentviii, 197 leavesen
dc.format.mimetypeapplication/pdfen
dc.language.isoen_USen
dc.publisherVirginia Polytechnic Institute and State Universityen
dc.relation.isformatofOCLC# 9022857en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.lccLD5655.V856 1982.S462en
dc.subject.lcshInteger programmingen
dc.subject.lcshProgramming (Mathematics)en
dc.titleThe extreme point mathematical programming problemen
dc.typeDissertationen
dc.contributor.departmentIndustrial Engineering and Operations Researchen
dc.description.degreePh. D.en
thesis.degree.namePh. D.en
thesis.degree.leveldoctoralen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.disciplineIndustrial Engineering and Operations Researchen
dc.type.dcmitypeTexten


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record