科研成果详情

发表状态已发表Published
题名Unifying condition numbers for linear programming
作者
发表日期2003
发表期刊Mathematics of Operations Research
ISSN/eISSN0364-765X
卷号28期号:4页码:609-624
摘要

In recent years, several condition numbers were defined for a variety of linear programming problems based upon relative distances to ill-posedness. In this paper, we provide a unifying view of some of these condition numbers. To do so, we introduce yet another linear programming problem and show that its distance to ill-posedness naturally captures the most commonly used distances to ill-posedness. © 2003, INFORMS.

关键词Complementarity problems Condition numbers Distance ill-posedness
DOI10.1287/moor.28.4.609.20520
URL查看来源
收录类别SCIE
语种英语English
WOS研究方向Operations Research & Management Science ; Mathematics
WOS类目Operations Research & Management Science ; Mathematics, Applied
WOS记录号WOS:000186855400001
Scopus入藏号2-s2.0-3142757851
引用统计
被引频次:16[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符https://repository.uic.edu.cn/handle/39GCC9TT/7779
专题个人在本单位外知识产出
通讯作者Cheung, Dennis
作者单位
1.Department of Mathematics,83 Tat Chee Avenue,Kowloon,Hong Kong
2.School of Industrial Administration,Carnegie Mellon University,5000 Forbes Avenue,Pittsburgh, PA 15213-3890,United States
推荐引用方式
GB/T 7714
Cheung, Dennis,Cucker, Felipe,Pena, Javier. Unifying condition numbers for linear programming[J]. Mathematics of Operations Research, 2003, 28(4): 609-624.
APA Cheung, Dennis, Cucker, Felipe, & Pena, Javier. (2003). Unifying condition numbers for linear programming. Mathematics of Operations Research, 28(4), 609-624.
MLA Cheung, Dennis,et al."Unifying condition numbers for linear programming". Mathematics of Operations Research 28.4(2003): 609-624.
条目包含的文件
条目无相关文件。
个性服务
查看访问统计
谷歌学术
谷歌学术中相似的文章
[Cheung, Dennis]的文章
[Cucker, Felipe]的文章
[Pena, Javier]的文章
百度学术
百度学术中相似的文章
[Cheung, Dennis]的文章
[Cucker, Felipe]的文章
[Pena, Javier]的文章
必应学术
必应学术中相似的文章
[Cheung, Dennis]的文章
[Cucker, Felipe]的文章
[Pena, Javier]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。