Show simple item record

dc.rights.licenseRestricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.
dc.contributorLemke, Carlton E.
dc.contributorCarter, Richard L.
dc.contributorEcker, Joseph G.
dc.contributorRogers, Edwin H.
dc.contributor.authorCohen, Stephen H.
dc.date.accessioned2021-11-03T08:19:28Z
dc.date.available2021-11-03T08:19:28Z
dc.date.created2015-04-10T16:07:30Z
dc.date.issued1975-06
dc.identifier.urihttps://hdl.handle.net/20.500.13015/1344
dc.descriptionJune 1975
dc.descriptionSchool of Science
dc.description.abstractA procedure is developed to solve a concave decomposable system. The general structure is treated in the same way as the classical Dantzig-Wolfe decomposition and Benders' partitioning procedures. Nonlinearities are permitted provided the objective function and coupling constraints are separable by subsystem. The decomposition is achieved by introducing a vector parameter and a new set of constraints.
dc.description.abstractFinally convergence theory that may be applied to investigate the convergence of cutting plane algorithms that do not require exact cuts is presented. This theory is of interest when the parameters of the cuts can not be calculated with a finite number of arithmetic operations and function evaluations. The theory indicates when one may truncate the calculations of the parameters after only a finite number of arithmetic operations and function evaluations without affecting convergence. The theory is applied to one aspect of the Tangential Approximation Procedure to indicate its possibilities.
dc.description.abstractA procedure is also developed under which inactive contraints can be dropped from cutting plane algorithms applied to problems with concave objective functions and constraints. This extends the work of Topkis, and Eaves and Zangwill who required a strict quasiconcavity assumption on the objective function.
dc.description.abstractUsing Topkis' notion of a limiting cutting plane function, it is shown that any accumulation point of the sequence generated by the procedure is an optimal solution to the original problem.
dc.description.abstractThe Tangential Approximation Procedure presented extends Geoffrion's study by improving the approximation to the objective function as well as to the implicitly defined feasible region of the parameter in the coordinating master program at each stage.
dc.language.isoENG
dc.publisherRensselaer Polytechnic Institute, Troy, NY
dc.relation.ispartofRensselaer Theses and Dissertations Online Collection
dc.subjectMathematical programming
dc.titleA convergent tangential approximation procedure for a decomposable nonlinear system
dc.typeElectronic thesis
dc.typeThesis
dc.digitool.pid174920
dc.digitool.pid174921
dc.digitool.pid174922
dc.rights.holderThis electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
dc.description.degreePhD
dc.relation.departmentDept. of Mathematical Sciences


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record