dc.contributor.advisor Merkle, M. G. dc.creator Pegram, Joe Donald dc.date.accessioned 2020-01-08T17:51:20Z dc.date.available 2020-01-08T17:51:20Z dc.date.created 1968 dc.date.issued 1974 dc.identifier.uri http://hdl.handle.net/1969.1/DISSERTATIONS-172772 dc.description.abstract In this dissertation consideration is given to the optimization of a function of n variables subject to constraints which restrict the allowable solution space. In particular, the functions composing the problem must be of a separable nature. Thus it must be possible to describe the functional to be optimized and the constraints comprising the problem as sums of functions of a single variable. The approach to solving the problem in question is to first replace the nonlinear problem by an approximating problem. In particular, the nonlinear functions in the problem are replaced by polygonal approximations. The approximating problem developed will offer from previous approximations in that it is a linear, mixed-integer problem. This approach will have the advantage that the solution of the problem is the global optimum of the approximating problem. Conversely, there is the disadvantage of involving integer programming problems has been disappointing for even problems of moderate size. However, this difficulty is resolved by the development of a specialized algorithm. After construction of the approximation problem, which in essence divides the solution space into a series of hypercubes, a particular problem is solved by simplex methods to yield the optimum for specified hypercube. The hypercube specified is determined by the choice of a [articular vector of zeroes and ones, called the u-vector, for there exists a one-to-one relationship between u-vectors and hypercubes &. en dc.format.extent 63 pages en dc.format.medium electronic en dc.format.mimetype application/pdf dc.language.iso eng dc.rights This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. en dc.rights.uri http://rightsstatements.org/vocab/InC/1.0/ dc.subject Statistics en dc.title Global optimization of nonconvex separable programs en dc.type Thesis en thesis.degree.grantor Texas A&M University en thesis.degree.name Doctor of Philosophy en thesis.degree.level Doctoral en dc.contributor.committeeMember Meyer, R. E. dc.contributor.committeeMember Swoba, A. R. dc.type.genre dissertations en dc.type.material text en dc.format.digitalOrigin reformatted digital en dc.publisher.digital Texas A&M University. Libraries
﻿

### This item appears in the following Collection(s)

This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.