| Article ID: | iaor20003776 |
| Country: | Singapore |
| Volume: | 16 |
| Issue: | 2 |
| Start Page Number: | 185 |
| End Page Number: | 202 |
| Publication Date: | Nov 1999 |
| Journal: | Asia-Pacific Journal of Operational Research |
| Authors: | Pedro Jocelyn C. San |
| Keywords: | programming: linear |
In this paper, we present a systematic approach to updating weights in multiple objective linear programming. We develop a number of extensions to the simplex theory which leads to the identification of (a) alternative weight vectors for which a current efficient solution remains optimal, and (b) adjacent efficient solutions. We also give an example to illustrate the proposed approach.