How to Analyze the Results of Linear Programs—Part 1: Preliminaries

Harvey J. Greenberg
Additional contact information
Harvey J. Greenberg: Mathematics Department, University of Colorado at Denver, PO Box 173364, Denver, Colorado 80217-3364

Interfaces, 1993, vol. 23, issue 4, 56-67

Abstract: In a four part series, I describe ways to analyze the results of linear programs beyond what is commonly described in textbooks. My intent is to capture the thought process in analysis with two objectives. First, I want to provide a guide to those getting started in applications of linear programming by suggesting useful ways of looking at the results. Second, I want to help create an artificially intelligent environment for the analysis of results by presenting a protocol that a knowledge engineer can use. The former has been in the folklore for decades; the latter is part of a project to develop an intelligent mathematical programming system. This first part of the series contains basic terms and concepts used in the other three parts: price interpretation, infeasibility diagnosis, and forcing substructures.

Keywords: programming:; linear (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/inte.23.4.56 (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:orinte:v:23:y:1993:i:4:p:56-67

Access Statistics for this article

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