Technical Note—Solutions of a Special Class of Linear Programming Problems

V. A. Sposito
Additional contact information
V. A. Sposito: Iowa State University, Ames, Iowa

Operations Research, 1973, vol. 21, issue 1, 386-388

Abstract: Explicit solutions for linear problems of the form: maximize ( h , x ), subject to Ax ≦ b , b ∈ R ( A ), are given, as well as explicit solutions for its dual problem. This note replaces the full row rank assumption on A of earlier results of Ben-Israel and Charnes by the assumption b ∈ R ( A ). With this assumption, explicit solutions are derived for the dual problem that are different from related results of Zlobec and Ben-Israel.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.386 (application/pdf)

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:inm:oropre:v:21:y:1973:i:1:p:386-388

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().