Technical Note—Duality Theory for Generalized Linear Programs with Computational Methods

David J. Thuente
Additional contact information
David J. Thuente: Indiana University-Purdue University, Fort Wayne, Indiana

Operations Research, 1980, vol. 28, issue 4, 1005-1011

Abstract: This paper presents a duality theory for generalized linear programs which parallels the usual duality results for linear programming. The duals are a form of inexact linear programs and can be solved by the simplex method. Computational methods with examples and applications are given.

Date: 1980
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.4.1005 (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:28:y:1980:i:4:p:1005-1011

Access Statistics for this article

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