nurdan Çetin - Academia.edu (original) (raw)

nurdan Çetin

Uploads

Papers by nurdan Çetin

Research paper thumbnail of A Fuzzy Approach Using Generalized Dinkelbach’s Algorithm for Multiobjective Linear Fractional Transportation Problem

Mathematical Problems in Engineering, 2014

We consider a multiobjective linear fractional transportation problem (MLFTP) with several fracti... more We consider a multiobjective linear fractional transportation problem (MLFTP) with several fractional criteria, such as, the maximization of the transport profitability like profit/cost or profit/time, and its two properties are source and destination. Our aim is to introduce MLFTP which has not been studied in literature before and to provide a fuzzy approach which obtain a compromise Pareto-optimal solution for this problem. To do this, first, we present a theorem which shows that MLFTP is always solvable. And then, reducing MLFTP to the Zimmermann’s “min” operator model which is the max-min problem, we construct Generalized Dinkelbach’s Algorithm for solving the obtained problem. Furthermore, we provide an illustrative numerical example to explain this fuzzy approach.

Research paper thumbnail of Parçali Li̇neer Üyeli̇k Fonksi̇yonlarini Kullanarak Çok Amaçli Li̇neer Kesi̇rli̇ Taşima Problem (Çalktp) Çözümüne Bulanik …

Journal of Naval Science and Engineering, 2009

Research paper thumbnail of A Fuzzy Approach Using Generalized Dinkelbach’s Algorithm for Multiobjective Linear Fractional Transportation Problem

Mathematical Problems in Engineering, 2014

We consider a multiobjective linear fractional transportation problem (MLFTP) with several fracti... more We consider a multiobjective linear fractional transportation problem (MLFTP) with several fractional criteria, such as, the maximization of the transport profitability like profit/cost or profit/time, and its two properties are source and destination. Our aim is to introduce MLFTP which has not been studied in literature before and to provide a fuzzy approach which obtain a compromise Pareto-optimal solution for this problem. To do this, first, we present a theorem which shows that MLFTP is always solvable. And then, reducing MLFTP to the Zimmermann’s “min” operator model which is the max-min problem, we construct Generalized Dinkelbach’s Algorithm for solving the obtained problem. Furthermore, we provide an illustrative numerical example to explain this fuzzy approach.

Research paper thumbnail of Parçali Li̇neer Üyeli̇k Fonksi̇yonlarini Kullanarak Çok Amaçli Li̇neer Kesi̇rli̇ Taşima Problem (Çalktp) Çözümüne Bulanik …

Journal of Naval Science and Engineering, 2009

Log In