SUCCESSIVE TWO SEGMENT SEPARABLE PROGRAMMING FOR NONLINEAR MINIMAX OPTIMIZATION.

Persistent Link:
http://hdl.handle.net/10150/275509
Title:
SUCCESSIVE TWO SEGMENT SEPARABLE PROGRAMMING FOR NONLINEAR MINIMAX OPTIMIZATION.
Author:
Dunatunga, Manimelwadu Samson, 1958-
Issue Date:
1986
Publisher:
The University of Arizona.
Rights:
Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.
Type:
text; Thesis-Reproduction (electronic)
Keywords:
Linear programming.; Mathematical optimization.
Degree Name:
M.S.
Degree Level:
masters
Degree Program:
Graduate College; Systems and Industrial Engineering
Degree Grantor:
University of Arizona

Full metadata record

DC FieldValue Language
dc.language.isoen_USen_US
dc.titleSUCCESSIVE TWO SEGMENT SEPARABLE PROGRAMMING FOR NONLINEAR MINIMAX OPTIMIZATION.en_US
dc.creatorDunatunga, Manimelwadu Samson, 1958-en_US
dc.contributor.authorDunatunga, Manimelwadu Samson, 1958-en_US
dc.date.issued1986en_US
dc.publisherThe University of Arizona.en_US
dc.rightsCopyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author.en_US
dc.typetexten_US
dc.typeThesis-Reproduction (electronic)en_US
dc.subjectLinear programming.en_US
dc.subjectMathematical optimization.en_US
thesis.degree.nameM.S.en_US
thesis.degree.levelmastersen_US
thesis.degree.disciplineGraduate Collegeen_US
thesis.degree.disciplineSystems and Industrial Engineeringen_US
thesis.degree.grantorUniversity of Arizonaen_US
dc.identifier.proquest1327833en_US
dc.identifier.oclc15207048en_US
dc.identifier.bibrecord.b1587154xen_US
All Items in UA Campus Repository are protected by copyright, with all rights reserved, unless otherwise indicated.