On a variant of lexicographic multi-objective programming
β Scribed by J.K. Sankaran
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 514 KB
- Volume
- 107
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
Duality theory is applied to measure the sensitivity of a multi-objective programming problem. Since the dual problem does not always measure primal sensitivity, the paper states necessary and sufficient conditions (homogeneity conditions) to guarantee the existence and uniqueness of a pair of solut