Projection and restriction methods in geometric programming and related problems |
| |
Authors: | R A Abrams C T Wu |
| |
Institution: | (1) Graduate School of Business, University of Chicago, Chicago, Illinois;(2) School of Business Administration, University of Wisconsin—Milwaukee, Milwaukee, Wisconsin |
| |
Abstract: | Mathematical programming problems with unattained infima or unbounded optimal solution sets are dual to problems which lackinterior points, e.g., problems for which the Slater condition fails to hold or for which the hypothesis of Fenchel's theorem fails to hold. In such cases, it is possible to project the unbounded problem onto a subspace and to restrict the dual problem to an affine set so that the infima are not altered. After a finite sequence of such projections and restrictions, dual problems are obtained which have bounded optimal solution sets andinterior points. Although results of this kind have occasionally been used in other contexts, it is in geometric programming (both in the original psynomial form and the generalized form) where such methods appear most useful. In this paper, we present a treatment of dual projection and restriction methods developed in terms of dual generalized geometric programming problems. Analogous results are given for Fenchel and ordinary dual problems.This research was supported in part by Grant No. AFOSR-73-2516 from the Air Force Office of Scientific Research and by Grant No. NSF-ENG-76-10260 from the National Science Foundation.The authors wish to express their appreciation to the referees for several helpful comments. |
| |
Keywords: | Geometric programming convex programming Slater condition projections restrictions duality |
本文献已被 SpringerLink 等数据库收录! |
|