Internal convex programming, orthogonal linear programming, and program generation procedures

Simple item page
dc.contributor.authorRistroph, John Hearden
dc.contributor.departmentIndustrial Engineering and Operations Researchen
dc.date.accessioned2014-03-14T21:08:44Zen
dc.date.adate2010-01-05en
dc.date.available2014-03-14T21:08:44Zen
dc.date.issued1975en
dc.date.rdate2010-01-05en
dc.date.sdate2010-01-05en
dc.description.abstractThree topics are developed: interval convex programming, and program generation techniques. The interval convex programming problem is similar to the convex programming problem of the real number system except that all parameters are specified as intervals of real numbers rather than as real scalars. The interval programming solution procedure involves the solution of a series of 2n real valued convex programs where n is the dimension of the space. The solution of an interval programming problem is an interval vector which contains all possible solutions to any real valued convex program which may be realized. Attempts to improve the efficiency of the interval convex programming problem lead to the eventual development of a new solution procedure for the real valued linear programming problem, Orthogonal linear programming. This new algorithm evolved from some heuristic procedures which were initially examined in the attempt to improve solution efficiency. In the course of testing these heuristics, which were unsuccessful, procedures were developed whereby it is possible to generate discrete and continuous mathematical programs with randomly chosen parameters, but known solutions.en
dc.description.degreePh. D.en
dc.format.extent191 leavesen
dc.format.mediumBTDen
dc.format.mimetypeapplication/pdfen
dc.identifier.otheretd-01052010-020024en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-01052010-020024/en
dc.identifier.urihttp://hdl.handle.net/10919/37182en
dc.language.isoenen
dc.publisherVirginia Techen
dc.relation.haspartLD5655.V856_1975.R55.pdfen
dc.relation.isformatofOCLC# 21258180en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subject.lccLD5655.V856 1975.R55en
dc.subject.lcshComputer programmingen
dc.subject.lcshConvex programmingen
dc.subject.lcshLinear programmingen
dc.titleInternal convex programming, orthogonal linear programming, and program generation proceduresen
dc.typeDissertationen
dc.type.dcmitypeTexten
thesis.degree.disciplineIndustrial Engineering and Operations Researchen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.leveldoctoralen
thesis.degree.namePh. D.en

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LD5655.V856_1975.R55.pdf
Size:
6.75 MB
Format:
Adobe Portable Document Format
Description:
Download

Collections

Doctoral Dissertations