AbstractThis paper investigates the notion of nondominance in goal programming (GP). Nondominance in the standard sense of a vector maximum (VM) problem is not always desirable. A definition of “GP-nondominance” and a test for determining whether an optimal GP solution is GP-nondominated are provided. It is demonstrated that one or more GP-nondominated solutions can be found by exploring the alternative optima of the GP solution. A formulation for determining the set of GP-nondominated solutions is provided and examples are used to illustrate the concept of GP nondominance.
[1]
Ralph E. Steuer,et al.
A revised simplex method for linear multiple objective programs
,
1973,
Math. Program..
[2]
P. Yu,et al.
The set of all nondominated solutions in linear cases and a multicriteria simplex method
,
1975
.
[3]
Jsh Kornbluth,et al.
A survey of goal programming
,
1973
.
[4]
Ralph E. Steuer.
Multiple Objective Linear Programming with Interval Criterion Weights
,
1976
.
[5]
D. H. Marks,et al.
A review and evaluation of multiobjective programing techniques
,
1975
.