Abstract
A decomposition method for nonlinear programming problems with structured linear constraints is described. The structure of the constraint matrix is assumed to be block diagonal with a few coupling constraints or variables, or both. The method is further specialized for linear objective functions. An algorithm for performing post optimality analysis—ranging and parametric programming—for such structured linear programs is included. Some computational experience and results for the linear case are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.