<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article"><front><journal-meta><journal-id journal-id-type="publisher-id">INFORMATICA</journal-id><journal-title-group><journal-title>Informatica</journal-title></journal-title-group><issn pub-type="epub">0868-4952</issn><issn pub-type="ppub">0868-4952</issn><publisher><publisher-name>VU</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">INF11406</article-id><article-id pub-id-type="doi">10.3233/INF-2000-11406</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research article</subject></subj-group></article-categories><title-group><article-title>Computing True Shadow Prices in Linear Programming</article-title></title-group><contrib-group><contrib contrib-type="Author"><name><surname>Ho</surname><given-names>James K.</given-names></name><email xlink:href="mailto:imho@uic.edu">imho@uic.edu</email><xref ref-type="aff" rid="j_INFORMATICA_aff_000"/></contrib><aff id="j_INFORMATICA_aff_000">Information and Decision Sciences, University of Illinois at Chicago, m/c 294, 601 South Morgan, Chicago, IL 60607, USA</aff></contrib-group><pub-date pub-type="epub"><day>01</day><month>01</month><year>2000</year></pub-date><volume>11</volume><issue>4</issue><fpage>421</fpage><lpage>434</lpage><history><date date-type="received"><day>01</day><month>08</month><year>2000</year></date></history><abstract><p>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.</p></abstract><kwd-group><label>Keywords</label><kwd>linear programming</kwd><kwd>shadow prices</kwd><kwd>optimization software</kwd></kwd-group></article-meta></front></article>