Nondominance In Goal Programming
- 1 November 1980
- journal article
- research article
- Published by Taylor & Francis in INFOR: Information Systems and Operational Research
- Vol. 18 (4) , 300-309
- https://doi.org/10.1080/03155986.1980.11731801
Abstract
This 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.Keywords
This publication has 5 references indexed in Scilit:
- Multiple Objective Linear Programming with Interval Criterion WeightsManagement Science, 1976
- A review and evaluation of multiobjective programing techniquesWater Resources Research, 1975
- The set of all nondominated solutions in linear cases and a multicriteria simplex methodJournal of Mathematical Analysis and Applications, 1975
- A revised simplex method for linear multiple objective programsMathematical Programming, 1973
- A survey of goal programmingOmega, 1973