Informatica logo


Login Register

  1. Home
  2. Issues
  3. Volume 11, Issue 4 (2000)
  4. Computing True Shadow Prices in Linear P ...

Informatica

Information Submit your article For Referees Help ATTENTION!
  • Article info
  • Related articles
  • More
    Article info Related articles

Computing True Shadow Prices in Linear Programming
Volume 11, Issue 4 (2000), pp. 421–434
James K. Ho  

Authors

 
Placeholder
https://doi.org/10.3233/INF-2000-11406
Pub. online: 1 January 2000      Type: Research Article     

Received
1 August 2000
Published
1 January 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.

Related articles PDF XML
Related articles PDF XML

Copyright
No copyright data available.

Keywords
linear programming shadow prices optimization software

Metrics
since January 2020
616

Article info
views

0

Full article
views

624

PDF
downloads

167

XML
downloads

Export citation

Copy and paste formatted citation
Placeholder

Download citation in file


Share


RSS

INFORMATICA

  • Online ISSN: 1822-8844
  • Print ISSN: 0868-4952
  • Copyright © 2023 Vilnius University

About

  • About journal

For contributors

  • OA Policy
  • Submit your article
  • Instructions for Referees
    •  

    •  

Contact us

  • Institute of Data Science and Digital Technologies
  • Vilnius University

    Akademijos St. 4

    08412 Vilnius, Lithuania

    Phone: (+370 5) 2109 338

    E-mail: informatica@mii.vu.lt

    https://informatica.vu.lt/journal/INFORMATICA
Powered by PubliMill  •  Privacy policy