1987
DOI: 10.2307/1242192
|View full text |Cite
|
Sign up to set email alerts
|

Nearly Optimal Linear Programming Solutions: Some Conceptual Issues and a Farm Management Application

Abstract: Nearly optimal solutions in linear programming provide useful information to decision makers. Modeling to generate alternatives may be used to generate a set of nearly optimal solutions from which a decision maker may select the desired solution by considering criteria not quantified in the model. The mathematical problem is to find vertices of a convex polytope. A pivoting method of vertex enumeration is used to generate all extreme-point nearly optimal solutions of an example problem involving selection of a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0
1

Year Published

1991
1991
2015
2015

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(7 citation statements)
references
References 10 publications
0
6
0
1
Order By: Relevance
“…Methods have been developed to enumerate all the extreme points of a polytope (Mattheiss and Rubin, 1980) but, when the number of decision variables is too high, the calculations are intractable. As a rule of thumb, Burton et al (1987) fixed the upper limit on model size for a complete enumeration of the extreme points at 50 decision variables and 50 constraints. Thus, in practice, one can generate only a part of the possible extreme nearly optimal solutions.…”
Section: A Linear Programming Model Is Defined Bymentioning
confidence: 99%
“…Methods have been developed to enumerate all the extreme points of a polytope (Mattheiss and Rubin, 1980) but, when the number of decision variables is too high, the calculations are intractable. As a rule of thumb, Burton et al (1987) fixed the upper limit on model size for a complete enumeration of the extreme points at 50 decision variables and 50 constraints. Thus, in practice, one can generate only a part of the possible extreme nearly optimal solutions.…”
Section: A Linear Programming Model Is Defined Bymentioning
confidence: 99%
“…The MGA approach has been used by civil engineers in water resource planning problems (Chang, Brill and Hopkins, 1982;Harrington and Gidley, 1985). More recently, MGA has been used in a farm management application to select a marketing strategy for calf producers (Burton et al, 1987).…”
Section: Modelling To Generate Alternativesmentioning
confidence: 99%
“…A number of enumeration algorithms have been developed to identify the extreme points on a convex polytope (Dyer and Proll, 1977;Dyer, 1983). Burton et al (1987) also provide a method of computing the number of possible extreme points for a given problem. An enormous number of alternative solutions can be generated for most empirical problems using these types of procedures.…”
Section: Modelling To Generate Alternativesmentioning
confidence: 99%
“…MGA has been used by civil engineers for water resource planning problems iChang, Hopkins 1982: Harrington andGidley 1985) and more recently in a farm management application to select a marketing strategy for calf producers (Burton et al 1987). The MGA approach is based on the premise that modeling should be a tool of the decision maker rather than a replacement for the decision maker (Gidley and Bari 1986).…”
Section: Modeling To Generate Alternativesmentioning
confidence: 99%