Multi-objective linear plus linear fractional programming problem based on Taylor series approximation
Pramanik Surapati, Pratim Dey Partha, C. Giri Bibhas
Abstract
Pramanik Surapati, Pratim Dey Partha, C. Giri Bibhas
Abstract
paper deals with fuzzy goal programming approach to multi-objective linear plus linear fractional programming problem based on Taylor series approximation. In the model formulation of the problem, we first construct the membership functions by determining individual optimal solutions of the objective functions subject to the system constraints. The membership functions are then transformed into equivalent linear membership functions by 1 st order Taylor series approximation. Then fuzzy goal programming models are formulated in order to solve the problem by minimizing negative deviational variables. Euclidean distance function is then used to obtain compromise optimal solution. To demonstrate the efficiency and feasibility of the proposed approach, two numerical examples are solved and compared with existing methods in the literature.
OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
paper deals with fuzzy goal programming approach to multi-objective linear plus linear fractional programming problem based on Taylor series approximation. In the model formulation of the problem, we first construct the membership functions by determining individual optimal solutions of the objective functions subject to the system constraints. The membership functions are then transformed into equivalent linear membership functions by 1 st order Taylor series approximation. Then fuzzy goal programming models are formulated in order to solve the problem by minimizing negative deviational variables. Euclidean distance function is then used to obtain compromise optimal solution. To demonstrate the efficiency and feasibility of the proposed approach, two numerical examples are solved and compared with existing methods in the literature.
Key concepts: Taylor series, Mathematical optimization, Linear-fractional programming, Linear programming, Computer science, Series (stratigraphy), Fractional programming, Euclidean geometry