| 李来义,郭栋.正项几何规划的－维探索法[J].计算力学学报,1995,12(4): |
|
| |
| 正项几何规划的－维探索法 |
| One-dimensional searching method for positive coefficient geometric programming |
| |
| DOI：10.7511/jslx19954073 |
| 中文关键词: 几何规划 线性规划／一维搜索 |
| 英文关键词:geometricinl programming,linear programming/one-dimemsional searching, |
| 基金项目: |
| 李来义 郭栋 |
| 天津城建学院土木工程系，天津大学 |
| 摘要点击次数: 1001 |
| 全文下载次数: 0 |
| 中文摘要: |
| 本文对正项几何规划的多困难度情况提供一个有效的方法，即将困难度为Ｄ的几何规划首先化为Ｄ维线性规划，然后再化为一维搜索问题。结果表明，该法十分有效。 |
| 英文摘要: |
| This paper gives an efficient method for solving positive coefficient geometric programming with manydegrees of difficulty.First of all the geometric programrning with D degree of difficulty is transformed into lin-ear programming with a D-dimensional and then into one-dimensional searching problem.The result showsthat this method is efficient. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
