| 来源类型 | Article |
| 规范类型 | 其他 |
| Tatonnement procedures for linearly constrained convex optimization. | |
| Kallio MJ; Salo S | |
| 发表日期 | 1994 |
| 出处 | Management Science 40 (6): 788-797. |
| 出版年 | 1994 |
| 语种 | 英语 |
| 摘要 | The emphasis in this article is to exploit the fact that precision requirements for solutions of most economic models in practice are moderate only. A simple approach is introduced for solving linearly constrained partial equilibrium models based on an iterative scheme similar to the simplex method. It allows large-scale models to be solved, within a practical tolerance, efficiently even in a micro computer environment. Extensions to linearly constrained convex optimization problems are presented. Finally, a set of computational tests on 68 linear programs from the NETLIB library is reported. Comparison of our approach with the simplex method (using MINOS 5.1) and with Karmarkar's algorithm is reported. For moderate precision requirements these preliminary results are highly encouraging. |
| 主题 | Risk Analysis and Policy (RAP) |
| URL | http://pure.iiasa.ac.at/id/eprint/3848/ |
| 来源智库 | International Institute for Applied Systems Analysis (Austria) |
| 资源类型 | 智库出版物 |
| 条目标识符 | http://119.78.100.153/handle/2XGU8XDN/127241 |
| 推荐引用方式 GB/T 7714 | Kallio MJ,Salo S. Tatonnement procedures for linearly constrained convex optimization.. 1994. |
| 条目包含的文件 | 条目无相关文件。 | |||||
| 个性服务 |
| 推荐该条目 |
| 保存到收藏夹 |
| 导出为Endnote文件 |
| 谷歌学术 |
| 谷歌学术中相似的文章 |
| [Kallio MJ]的文章 |
| [Salo S]的文章 |
| 百度学术 |
| 百度学术中相似的文章 |
| [Kallio MJ]的文章 |
| [Salo S]的文章 |
| 必应学术 |
| 必应学术中相似的文章 |
| [Kallio MJ]的文章 |
| [Salo S]的文章 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
