A modified concave simplex algorithm for geometric programming |
| |
Authors: | P A Beck J G Ecker |
| |
Institution: | 1. Armament Development and Test Center (TSX), USAF, Eglin AFB, Florida 2. Department of Mathematics, Rensselaer Polytechnic Institute, Troy, New York
|
| |
Abstract: | An algorithm for solving posynomial geometric programs is presented. The algorithm uses a modification of the concave simplex method to solve the dual program which has a nondifferentiable objective function. The method permits simultaneous changes in certain blocks of dual variables. A convergence proof follows from the convergence proof of the concave simplex method. Some computational results on problems with up to forty degrees of difficulty are included. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|