Fuzzy programming and linear programming with several objective functions
Generate an AI Snapshot to get a quick, structured summary of this paper.
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
It is shown that solutions obtained by fuzzy linear programming are always efficient solutions and the consequences of using different ways of combining individual objective functions in order to determine an “optimal” compromise solution are shown.
Abstract
In the recent past numerous models and methods have been suggested to solve the vectormaximum problem. Most of these approaches center their attention on linear programming problems with several objective functions. Apart from these approaches the theory of fuzzy sets has been employed to formulate and solve fuzzy linear programming problems. This paper presents the application of fuzzy linear programming approaches to the linear vectormaximum problem. It shows that solutions obtained by fuzzy linear programming are always efficient solutions. It also shows the consequences of using different ways of combining individual objective functions in order to determine an “optimal” compromise solution.