Decomposition of the convex simplex method |
| |
Authors: | W S Hsia |
| |
Institution: | 1. Department of Mathematics, University of Alabama, University, Alabama
|
| |
Abstract: | Rutenberg (Ref. 1) provided a decomposition method to solve the problem of minimizing a separable, nonlinear objective function with large-scale linear constraints by using the convex simplex method (Ref. 2). However, there seem to be some errors in his paper (Ref. 3). This paper will rebuild the method by using more convenient and consistent notation. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|