.png){kind=icon}
返回
Technical Note—Constraint Qualifications for Inexact Linear Programs
.png){kind=icon}
PRE
AI
DOI：10.1287/opre.27.4.843.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
By means of a new constraint qualification, we establish a duality theorem for inexact linear programs, complementing the results stated by Soyster, which, as shown by two examples, are not generally true without further assumptions. Qualifications are then discussed in this context.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
暂无期刊信息
机构
暂无机构信息
引用论文
暂无论文信息