Computing True Shadow Prices in Linear Programming
Informatica, Lith. Acad. Sci.(2000)
摘要
Abstract. It is well known that in linear programming, the optimal values of the dual variables can be interpreted as shadow prices (marginal values) of the right-hand side coefficients. However, this is true only under nondegeneracy assumptions. Since real problems are often degenerate, the output from conventional LP software regarding such marginal information can be misleading. This paper surveys and generalizes known,results in this topic and demonstrates how,true shadow,prices can be computed,with or without modification to existing software. Key words: linear programming, shadow prices, optimization software.
更多查看译文
关键词
shadow prices,optimization software.,linear programming,value,variables,coefficients,shadow price,optimization,computations,linear program
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要