An approach to updating weights in multiple objective linear programming

Abstract

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.

Source or Periodical Title

Asia-Pacific Journal of Operational Research

ISSN

2175959

Page

185-202

Document Type

Article

Subject

Multiple objective linear programming, Weight-update method

This document is currently not available here.

Share

COinS