| 来源类型 | Monograph (IIASA Working Paper) |
| 规范类型 | 论文 |
| A Penalty Based Simplex Method for Linear Programming. | |
| Swietanowski A | |
| 发表日期 | 1995 |
| 出版者 | IIASA, Laxenburg, Austria: WP-95-005 |
| 出版年 | 1995 |
| 语种 | 英语 |
| 摘要 | We give a general description of a new advanced implementation of the simplex method for linear programming. The method ``decouples'' a notion of the simplex basic solution into two independent entities: a solution and a basis. This generalization makes it possible to incorporate new strategies into the algorithm since the iterates no longer need to be the vertices of the simplex. An advantage of such approach is a possibility of taking steps along directions that are not simplex edges (in principle they can even cross the interior of the feasible set). It is exploited in our new approach to finding the initial solution in which global infeasibility is handled through a dynamically adjusted penalty term. |
| 主题 | Optimization under Uncertainty (OPT) |
| URL | http://pure.iiasa.ac.at/id/eprint/4587/ |
| 来源智库 | International Institute for Applied Systems Analysis (Austria) |
| 资源类型 | 智库出版物 |
| 条目标识符 | http://119.78.100.153/handle/2XGU8XDN/124461 |
| 推荐引用方式 GB/T 7714 | Swietanowski A. A Penalty Based Simplex Method for Linear Programming.. 1995. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 资源类型 | 版本类型 | 开放类型 | 使用许可 | ||
| WP-95-005.pdf（1089KB） | 智库出版物 | 限制开放 | CC BY-NC-SA | 浏览 | ||
| 个性服务 |
| 推荐该条目 |
| 保存到收藏夹 |
| 导出为Endnote文件 |
| 谷歌学术 |
| 谷歌学术中相似的文章 |
| [Swietanowski A]的文章 |
| 百度学术 |
| 百度学术中相似的文章 |
| [Swietanowski A]的文章 |
| 必应学术 |
| 必应学术中相似的文章 |
| [Swietanowski A]的文章 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
