Answers are grounded in this paper and cite their sources.
In this paper we propose an approach which makes it possible to search non-dominated and only non-dominated solutions in multiple-objective linear programming. The approach is based on the use of a reference direction and lexicographic parametric programming. The requisite theory is developed in the paper. The use of the approach is illustrated with a numerical example.
No takes yet. Share an insight, caveat, or question.
Korhonen et al. (1996) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: