Calculating the exact bounds of optimal valuesin LP with interval coefficients

Frantisÿek Mráz

Annals of Operations Research, 1998, vol. 81, issue 0, 62 pages

Abstract: The paper deals with computing the exact upper and lower bounds of optimal values forlinear programming problems whose coefficients vary in given intervals. The theoreticalbackground for calculating these bounds is described and corresponding algorithms aregiven. A comparison with other approaches, some applications and a software package arementioned. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018985914065 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:81:y:1998:i:0:p:51-62:10.1023/a:1018985914065

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018985914065

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().