• Login
    View Item 
    •   DSpace@RPI Home
    • Rensselaer Libraries
    • RPI Theses Online (Complete)
    • View Item
    •   DSpace@RPI Home
    • Rensselaer Libraries
    • RPI Theses Online (Complete)
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    A convergent tangential approximation procedure for a decomposable nonlinear system

    Author
    Cohen, Stephen H.
    View/Open
    174921_thesis.pdf (2.709Mb)
    Other Contributors
    Lemke, Carlton E.; Carter, Richard L.; Ecker, Joseph G.; Rogers, Edwin H.;
    Date Issued
    1975-06
    Subject
    Mathematical programming
    Degree
    PhD;
    Terms of Use
    This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.;
    Metadata
    Show full item record
    URI
    https://hdl.handle.net/20.500.13015/1344
    Abstract
    A 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.; Finally 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.; A 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.; Using 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.; The 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.;
    Description
    June 1975; School of Science
    Department
    Dept. of Mathematical Sciences;
    Publisher
    Rensselaer Polytechnic Institute, Troy, NY
    Relationships
    Rensselaer Theses and Dissertations Online Collection;
    Access
    Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.;
    Collections
    • RPI Theses Online (Complete)

    Browse

    All of DSpace@RPICommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    DSpace software copyright © 2002-2022  DuraSpace
    Contact Us | Send Feedback
    DSpace Express is a service operated by 
    Atmire NV