Heuristic Selection of Advanced Bases for a Class of Linear Programming Models

Martin Dillon
Additional contact information
Martin Dillon: University of North Carolina, Chapel Hill, North Carolina

Operations Research, 1973, vol. 21, issue 1, 90-100

Abstract: This paper describes a procedure for selecting a starting basis for a class of large linear programming models. This class, a generalization of the transportation problem, is the product of a matrix generator described elsewhere. The procedure is joined to the matrix-generator process and uses structural criteria and implicit knowledge of the model being generated to assess the attractiveness of vectors for an optimal solution. Additionally, it allows the analyst to describe, through a set of multipliers, the general features of the expected optimal solution. The multipliers are employed heuristically in conjunction with the other criteria to select a set of vectors, both logical and structural, for submission to a standard mathematical programming computational system as a starting basis. Examples of applications of the basis selector and possible extensions are presented.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.90 (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:90-100

Access Statistics for this article

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