MPE Mathematical Problems in Engineering 1563-5147 1024-123X Hindawi Publishing Corporation 702319 10.1155/2014/702319 702319 Research Article A Fuzzy Approach Using Generalized Dinkelbach’s Algorithm for Multiobjective Linear Fractional Transportation Problem Cetin Nurdan 1 Tiryaki Fatma 2 Lu Hao-Chun 1 Department of Mathematics Faculty of Science Turkish Naval Academy Tuzla Istanbul Turkey dho.edu.tr 2 Department of Mathematics Faculty of Arts and Science Yildiz Technical University Davutpasa Istanbul Turkey isbank.com.tr 2014 1732014 2014 30 09 2013 14 01 2014 21 01 2014 17 3 2014 2014 Copyright © 2014 Nurdan Cetin and Fatma Tiryaki. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

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.

1. Introduction

A lot of research work has been conducted on transportation problems. These problems and their solution techniques play an important role in logistics and supply chain management for reducing cost, improving service quality, and so forth. One of the hot research topics of transportation problems is the use of fuzzy set theory. In 1965, the concept of the fuzzy set was first introduced by Zadeh. Several authors gave the most significant papers on fuzzy sets and their applications. In practical applications, the required data of the real-life problems may be imprecise. Thus, adaptation of fuzzy sets theory in the solution process increases the flexibility and effectiveness of the proposed approaches. There are recent papers by Zadeh published in 2005 and 2008 [1, 2]. Fuzzy set theory has become foundation for the development of the fields of transportation systems, especially in their applications. The purpose of this paper is to introduce MLFTP which has not been studied in the literature before and to provide a fuzzy approach for this problem using the Generalized Dinkelbach’s Algorithm.

Fractional programming (FP) for single-objective optimization problems was studied extensively from the viewpoint of its application to several real-life problems. For instance, cost benefit analysis in agricultural production planning, faculty and other staff allocation problems for minimizing certain ratios of students’ enrolments and stuff structure within academic units of educational institutions, and other optimization problems frequently involve the fractional objectives in a decision situation . As known, a single-objective linear fractional programming is a special case of a nonlinear programming problem and it can be solved by using the variable transformation method  or the updated objective function method .

Now, since most of the decision making problems in practice are multiobjective in nature, FP with multiplicity of objectives has also been studied by the pioneer researches in the field . Concerning multiobjective linear fractional programming, Kornbluth and Steuer [6, 7], Nykowski and Zołkiewski , and Tiryaki , and also concerning multiobjective linear fractional programming under fuzzy environment, Luhandjula , Sakawa and Yumine , Sakawa and Yano , and Chakraborty and Gupta  proposed different approaches.

In real-life situations, multiple-objective linear transportation problem (MLTP) is more common. A lot of fuzzy research work has been conducted on MLTP. In [14, 15], Bit et al. developed a procedure using fuzzy programming technique, and an additive fuzzy programming model for the solution of the MLTP, respectively. In , Verma et al. used hyperbolic and exponential membership functions to solve the MLTP. In , Das et al. proposed a solution procedure of the MLTP where all parameters (the cost coefficients, the source, and destination parameters) have been expressed as interval values by the decision maker. El-Wahed  and Li and Lai  developed fuzzy approaches to get the compromise solution for MLTP. In , Liu and Kao developed a procedure to derive the fuzzy objective value of the fuzzy transportation problem, basing on the extension principle. Ammar and Youness  investigated the efficient solutions and stability of MLTP with fuzzy numbers. Abd El-Wahed and Lee  presented an interactive fuzzy goal programming approach to determine the preferred compromise solution for MLTP. Fuzzy approaches generally use Zimmermann’s fuzzy programming to solve MLTP . Due to the easiness of computation, the aggregate operator used in these fuzzy approaches is the “min” operator which does not guarantee a nondominated solution. However, these approaches are more practical than the others—interactive, noninteractive, and goal programming approaches—and have several good features as follows: easy to implement, generally provide the analyst with easy mathematical programming problem, use one of the available software, and so forth. On the other hand, the main disadvantage of fuzzy approaches is that Zimmermann’s “min” operator model does not fit the standard form of a transportation problem due to membership function constraints .

Transportation problem with fractional objective function is widely used as performance measure in many real-life situations, for example, in the analysis of financial aspects of transportation enterprises and undertaking and in transportation management situations, where an individual or a group of a community is faced with the problem of maintaining good ratios between some crucial parameters concerned with the transportation of commodities from certain sources to various destinations. In transportation problems, examples of fractional objectives include optimization of total actual transportation cost/total standard transportation cost, total return/total investment, risk assets/capital, and total tax/total public expenditure on commodity .

To deal with LFTP, it can be observed from literature that few works have been carried out except Bajalinov’s work . Bajalinov formulated LFTP in a general form and shortly overviewed its main theoretical results. The author’s main computational technique is the Transportation Simplex Method. Besides, he constructed the dual problem of LFTP and finally formulated the main statements of duality theory for this problem. Furthermore, Zenzerovic and Beslic  have presented a mathematical model addressing the problem of cargo transport by container ship on the selected route, where certain numbers of containers of various masses and types are chosen out of the total number of containers available in loading port in order to achieve maximum transport profitability, which is an index of operation efficiency of the firm and is expressed as profit/capital, provided maximum payload and transport capacity of container ship.

In this paper, our aim is to obtain a compromise Pareto-optimal solution for MLFTP by means of Zimmermann’s “min” operator. Using Generalized Dinkelbach’s Algorithm, MLFTP that has nonlinear structure is reduced to a sequence of linear programming problems. However, the solution generated by “min” operator does not guarantee Pareto-optimality. For this reason, we offer a Pareto-optimality test to obtain a compromise Pareto-optimal solution.

This paper is organized as follows. Section 2 presents MLFTP formulation and introduces the definitions of Pareto-optimal, weakly Pareto-optimal, and compromise solution for MLFTP. Section 3 explains our fuzzy approach to the MLFTP using Generalized Dinkelbach’s Algorithm and then how the Pareto-optimality test is conducted. Section 4 gives an illustrative example. The paper ends with some concluding remarks in Section 5.

2. Multiobjective Linear Fractional Transportation Problem

Assume that there are m sources and n destinations. At each source, let ai (i=1,2,,m) be the amount of homogenous products which are transported to n destinations to satisfy the demand for bj (j=1,2,,n) units of the product there. Let variable xij be units of goods shipped from source i to destination j. For the objective function zq(x), (q=1,,Q), profit matrix pq=[pijq]m×nwhich determines the profit pijq gained from shipment from i to j; cost matrix dq=[dijq]m×nwhich determines the cost dijq per unit of shipment from i to j; scalars p0q, d0q, which determine some constant profit and cost, respectively. Then the mathematical model of the MLFTP can be formulated as follows:(1a)maxzq(x)=pq(x)dq(x)=i=1mj=1npijq  xij+p0qi=1mj=1ndijq  xij+d0q,hhhhhhhhhhhhhhhhhhhhhhhhhhq=1,,Q,(1b)s.t.j=1nxijai,i=1,2,,m,(1c)i=1mxijbj,j=1,2,,n,(1d)xij0,i=1,2,,m;j=1,2,,n,where zq(x)=(z1(x),z2(x),,zQ(x)) is a vector of objective functions (criteria vector) and “max” means that all efficient solutions are to be found. We suppose that dq(x)>0, q=1,,Q and x=(xij)S, where S denotes a convex and compact feasible set defined by constraints (1b)–(1d); the functions pq(x) and dq(x) are continuous on S. Further, we assume that ai>0, i; bj>0, j; pijq>0, dijq>0, p0q>0, d0q>0 for all i, j, and (2)i=1m  aij=1nbj(total  supply  is  not  less  than  total  demand). The inequality (2) is treated as a necessary and sufficient condition for the existence of a feasible solution to problems (1a)–(1d).

Theorem 1.

MLFTP is solvable if and only if the above inequality (2) holds.

Proof.

Necessity. Suppose that MLFTP is solvable and x is its basic feasible solution. Adding together separately supply constraints (1b) for all indices i=1,2,,m, demand constraints (1c) for all indices j=1,2,,n, we obtain (3)i=1mj=1nxiji=1mai,j=1ni=1mxijj=1nbj, respectively. Since the left-hand sides of the inequalities obtained are exactly the same, total demand is smaller or equal to total supply. Hence, inequality (2) holds.

Sufficiency. Suppose now that inequality (2) holds. We have to show that in this case, feasible set S of problems (1a)–(1d) is not empty and all objective functions zq(x) and q=1,,Q over set S are bounded. Let (4)xij=aibjR,i=1,2,,m;j=1,2,,n, where (5)R=j=1nbj>0.

We will show that xij is a feasible solution of problems (1a)–(1d). Indeed, we have (6)j=1nxij=j=1naibjR=aiR  j=1nbj=aiRR=ai,  i=1,2,,m,i=1mxij=i=1mbjaiR=bjR  i=1mai(inequality  2)bjRj=1nbj=bjRR=bj,hhhhhhihhhhhhhj=1,2,,n, respectively. Hence, constraints (1b) and (1c) are satisfied by xij. Further, since ai>0, i and bj>0, j, it ensures us that xij0 for all indices i, j. Hence, we have shown that feasible set S is not empty and contains at least one feasible solution x=(xij).

From (1b) and (1d) we have that (7)0xijai,i=1,2,,m;j=1,2,,n. The latter means that feasible set is bounded.

Finally, since pq(x) and dq(x), q=1,,Q, are linear functions and dq(x)>0 and q=1,,Q are bounded over feasible set S, it means that all objective function zq(x) and q=1,,Q are also bounded over set S.

Hence, the MLFTP is solvable.

Definition 2.

If total demand equals total supply, that is, (8)i=1mai=j=1nbj,(balanced  condition) then the MLFTP is said to be a balanced transportation problem.

If a transportation problem has a total supply that is strictly less than total demand, the problem has no feasible solution. In this situation, it is sometimes desirable to allow the possibility of leaving some demand unmet. In such a case, we can balance a transportation problem by creating a dummy supply point that has a supply equal to the amount of unmet demand and associating a penalty with it.

By converting inequalities (1b) and (1c) into equalities, MLFTP in a canonical form can be defined.

Theorem 3.

MLFTP in a canonical form is solvable if and only if the above balanced condition (8) holds.

Proof.

This theorem can be proved by a procedure similar to Theorem 1.

In the context of multiple criteria, definitions of efficient and nondominated or Pareto-optimal solutions are used instead of the optimal solution concept in single-objective programming. In the multiple-objective linear fractional programming, the concept of the strongly efficient solution which corresponds to the standard definition of the efficient solution in multiobjective linear programming is insufficient, and therefore the weakly efficient concept is considered. In theory, finding the strongly efficient solutions is desired. However, in practice, solution algorithms tend to find weakly efficient solutions. This is because, vertexes of the weakly Pareto-optimal solution set (EW) construct a connected graph . Now we present the following definitions of Pareto-optimal, weakly Pareto-optimal, and compromise solution for MLFTP.

Definition 4 (Pareto-Optimal Solution for MLFTP).

The point x-S is a Pareto-optimal (strongly efficient or nondominated) solution if and only if there does not exist another xS such that zq(x)zq(x-) for all q=1,,Q and zq(x)>zq(x-) for at least one q.

Definition 5 (Weakly Pareto-Optimal Solution for MLFTP).

The point x-S is a weakly Pareto-optimal solution if and only if there does not exist another xS such that zq(x)>zq(x-) for all q=1,,Q.

According to these definitions, ESEW, where ES denotes the set of Pareto-optimal solutions.

Definition 6 (Compromise Solution [<xref ref-type="bibr" rid="B2">22</xref>, <xref ref-type="bibr" rid="B20">26</xref>, <xref ref-type="bibr" rid="B31">27</xref>] for MLFTP).

A feasible point x-S is a compromise solution if and only if x-EW and Z(x-)xS  Z(x) where Z(x)=(z1(x),z2(x),,zQ(x)) and stands for “min” operator.

According to Definition 6, (i) a solution should be weakly efficient to be a compromise solution; (ii) the feasible solution vector x- should have the minimum deviation from the ideal point than any other point in S. The compromise solution is the closest solution to the ideal one that maximizes the underlying utility function of the decision maker. So this compromise solution is obtained from the max-min problem.

In general, an optimal solution which simultaneously maximizes all the objective functions in MLFTP does not always exist when the objective functions conflict with each other. When a certain Pareto-optimal solution is selected, any improvement of one objective function can be achieved only at the expense of at least one of the other objective functions. Thus, the above Definition 4 for MLFTP is the same as the definition of the Pareto-optimality in multiobjective linear programming.

3. Solution Procedure

In this section, using Zimmermann’s “min” operator, we will give a fuzzy approach to obtain a compromise Pareto-optimal solution for MLFTP.

3.1. Constructing the Membership Functions of the Objectives

There are several membership functions in the literature, for example, linear, hyperbolic, and piecewise-linear, and so forth . For simplicity, in this paper, we adopt a linear membership function. We can define the membership function μq(zq) corresponding to qth objective as (9)μq(zq)={0,zq<zqm,zq-zqmzq*-zqm,zqmzqzq*,1,zq*<zq, where maxxSzq(x)=zq* and minxSzq(x)=zqm, q=1,,Q, denote the values of the objective function zq(x) such that the degrees of membership function are 1 and 0, respectively. The membership function is linear and strictly monotone increasing with respect to zq in the interval [zqm,zq*]. To construct (9) we note that we solved 2Q times a single-objective linear fractional transportation programming problem.

First of all, by using the “min” fuzzy operator model proposed by Zimmermann , the following problem is solved for MLFTP: (10)maxxSmin1qQμq(zq(x))s.t.xS. By introducing the auxiliary variable λ, (11)minμq(zq)=λμq(zq)λ, this problem can be transformed into the following equivalent maximization problem: (12)maxλs.t.μq(zq)λ,xS.

Here, since the membership function μq(zq) is the strictly monotone increasing for objective zq in the closed interval [zqm,zq*], from (12) we have (13)maxλs.t.zqμq-1(λ),xS, where (14)μq-1(λ)=inf{zqμq(zq)λ}.

Problem (13) or (10) is the “min” operator model for MLFTP and also a nonlinear programming model. Its optimal objective value λ* denotes the maximum of the least satisfaction levels among all objectives expressed as profit/cost or profit/time and so forth, simultaneously, and it can also be interpreted as the “most basic satisfaction” that each objective in this transportation system can attain.

The transportation problem in (10) is in nature of a generalized linear fractional programming problem. Therefore, our fuzzy approach for solving this transportation problem use an iterative algorithm based on Generalized Dinkelbach’s Algorithm [24, 30, 31]. It is known that “min-” operator model is a noncompensatory model . So, problem (10) produces the weakly Pareto-optimal solution for MLFTP, but it does not guarantee to get a Pareto-optimal solution. For this reason, the Pareto-optimality test given in Section 3.3 is applied to obtain the Pareto-optimal solution.

3.2. Generalization of Dinkelbach’s Algorithm for MLFTP

One of the most popular and general strategies for fractional programming (not necessary linear) is the parametric approach described by W. Dinkelbach. In the case of linear fractional programming, this algorithm reduces the solution of a sequence of linear programming problems . Therefore, it is efficient and robust in practice, and so it is preferable for MLFTP. Furthermore, even if the Dinkelbach’s algorithm may require longer solution time than metaheuristic, it allows getting the optimal solutions for several problems and verifying the efficiency of the metaheuristic methods .

In this section, we consider the max-min problem (10). For simplicity, let (15)μq(zq(x))=zq-zqmzq*-zqm=Pq(x)Dq(x),q=1,,Q be in the interval [zqm,zq*] and then problem (10) is equivalent to (16)λ-=max  xSmin  1qQ{Pq(x)Dq(x)}. We call this problem a generalized linear fractional transportation problem. Since all membership functions are linear fractional functions, this problem is solved by Generalized Dinkelbach’s Algorithm. This algorithm corresponds to solving a sequence of the following parametric problems: (17)F(λ)=maxxSmin1qQ(Pq(x)-λDq(x)). Before discussing the method, the following two lemmas will be introduced. These statements establish relations between the problem (16) and the problem (17) with parametric function F(λ).

Lemma 7 (see [<xref ref-type="bibr" rid="B6">24</xref>]).

Let (18)λ-=maxxSmin1qQ{Pq(x)Dq(x)}, then

parametric function F(λ)>-; moreover, F(λ) is lower semicontinuous and nondecreasing;

F(λ)>0 if and only if λ<λ-;

F(λ-)0;

if problem (16) is solvable then F(λ-)=0;

if F(λ-)=0 then problem (16) and problem (17) have the same set of optimal solutions (which may be empty).

Theorem 8 (see [<xref ref-type="bibr" rid="B13">33</xref>]).

Assume that S is compact. The following results hold.

Equations (16) and (17) always have an optimal solution, λ- is finite, and F(λ-)=0. Hence, F(λ)=0 implies λ=λ-.

Parametric function F is finite, continuous, and increasing on .

The sequence {λr}, if not finite, converges linearly to λ-, and each convergent subsequence of {xr} converges to an optimal solution of (16).

This lemma and theorem provide the necessary theoretical basis for a generalization of Dinkelbach’s algorithm. Algorithm is suggested that finds the constrained maximum of the minimum of finitely many ratios. The method involves a sequence of linear subproblems if the ratios are linear.

Now we can give Generalized Dinkelbach’s Algorithm for MLFTP.

Algorithm 9 (Generalized Dinkelbach’s Algorithm for MLFTP).

Step  0. Set r:=0.

Step  1. Take an arbitrary feasible solution xr(=x0)S, and (19)compute  λ(0)=min1qQ{Pq(x(0))Dq(x(0))}.

Step  2. Solve thefollowing problem: (20)maxts.t.1Dq(x(r))[Pq(x)-λrDq(x)]t,q=1,,Q,xS. Let the obtained solution be xr+1.

Step  3. If t<δ  (where δ>0 is the termination parameter) then the current solution x*=xr+1 is an optimal solution of the problem (16) and λ(r) is its optimal value, Stop. Otherwise, λ(r+1):=min1qQ{Pq(xr+1)/Dq(xr+1)} is computed. Set r:=r+1 and return to Step 2.

The convergence of sequence {λr} generated from parametric problem F(λr) in Step 2 is guaranteed by the following properties of the sequence:

for all r0, λ(r)=min1qQ  μq(zq(xr))λ*;

the sequence {λr} is monotone increasing,

where λ*=maxxSmin1qQμq(zq(x)).

3.3. Pareto-Optimality Test

A current solution x* obtained from Step 3 of the problem (10) is weakly Pareto-optimal compromise solution for problems (1a)–(1d). If an alternative optimal solution which has the same optimal value λ does not exist, then x* is also Pareto-optimal as well. On the other hand, if there is an alternative optimal solution, we conduct the following Pareto-optimality test in order to find the Pareto-optimal solution [6, 34]: (21)maxq=1Q  εqs.t.zq(x)-εqzq(x*),q=1,,Q,xS,x0,εq0,q=1,,Q. By doing the necessary substitution, we solve the following problem equivalently: (22)maxq=1Q  ε^qs.t.(i=1mj=1npijq  -i=1mj=1ndijq  zq*)·x-ε^qd0q·zq*-p0q,q=1,,Q,xS,x0,ε^q0,q=1,,Q. If max  q=1Qε^q=0, x* is the Pareto-optimal solution. Provided that maxq=1Qε^q>0, the solution to the last linear programming problem is x-, we resolve this Pareto linear programming problem by replacing x* with x-.

4. Numerical Example

Let us apply the fuzzy approach presented above to the following numerical example. Consider (23)maxz1(x)=x11+2x12+8x21+6x22+4x11+3x12+x21+2x22+2maxz2(x)=2x11+4x12+10x21+8x22+6x11+2x12+3x21+x22+4maxz3(x)=6x11+x12+4x21+5x22+82x11+x12+x21+3x22+5s.t.Supply  constraints:  x11+x12150x21+x22250Demand  constraints:x11+x2150x12+x22350x=(x11,x12,x21,x22)0.

Three linear fractional transportation problems are solved as nonlinear programming problems directly by using any available nonlinear programming package, for example, GAMS  and Gino or super Gino, or they are reduced to the linear programming problems with Charnes and Cooper variable transformation  and then solved by using the LP solver package such as winqsb and LINDO. The individual maxima and minima and corresponding solutions for three objectives are shown in Table 1. For example, the individual results for the objective function z1 are z1*=2.111 at x1*(0,150,50,200) and z1m=2.059 at x1m(50,100,0,250).

The individual maxima and minima and corresponding solutions.

z 1 z 2 z 3
z * 2.111 4.972 1.736
z m 2.059 4.138 1.687
x 1 * (0, 150, 50, 200) 2.111 4.138 1.687
x 1 m (50, 100, 0, 250) 2.059 4.972 1.736
x 2 * (50, 100, 0, 250) 2.059 4.972 1.736
x 2 m (0, 150, 50, 200) 2.111 4.138 1.687
x 3 * (50, 100, 0, 250) 2.059 4.972 1.736
x 3 m (0, 150, 50, 200) 2.111 4.138 1.687

By using (9) and Table 1, the membership functions of 3 objective functions in the interval [zqm,zq*] can be designed as follows: (24)μ1(z1(x))=(-20.366x11-80.328x12+114.251x21hhhhhh+36.193x22-2.269)×(x11+3x12+x21+2x22+2)-1,μ2(z2(x))=(-2.563x11-5.127x12-2.894x21hhhhhh+4.631x22-12.652)×(x11+2x12+3x21+x22+4)-1,μ3(z3(x))=(53.591x11-14.02x12+47.204x21hhhhhh-1.245x22-8.877)×(2x11+x12+x21+3x22+5)-1. “min” operator model corresponding to (10) for (23) will be in the form as follows: (25)maxλμ1(z1(x))λ(-20.366x11-80.328x12+114.251x21+36.193x22-2.269)×(x11+3x12+x21+2x22+2)-1λ,μ2(z2(x))λ(-2.563x11-5.127x12-2.894x21+4.631x22-12.652)×(x11+2x12+3x21+x22+4)-1λ,μ3(z3(x))λ(53.591x11-14.02x12+47.204x21-1.245  x22-8.877)×(2x11+x12+x21+3x22+5)-1λ,Supply  constraints:x11+x12150,x21+x22250Demand  constraints:x11+x2150,x12+x22350,x=(x11,x12,x21,x22)0. For solving problem (25) the Generalized Dinkelbach’s Algorithm proceeds as follows:

Step  0. Set r:=0.

Step  1. Let a feasible solution x(0)=(0,150,50,200)S to max{  0TxxS}. The satisfactory levels of the objectives corresponding to x(0) are μ1(z1(x(0)))=P1(x(0))/D1(x(0))=1, μ2(z2(x(0)))=P2(x(0))/D2(x(0))=0, and μ3(z3(x(0)))=P3(x(0))/D3(x(0))=0, and we compute the minimal satisfactory level of them as (26)λ(0)=min{P1(x(0))D1(x(0)),P2(x(0))D2(x(0)),P3(x(0))D3(x(0))}=0.

Step  2. Now, for λ(0)=0, we construct the following problem: (27)maxt1D1(x(0))[P1(x)-λ(0)D1(x)]t,1D2(x(0))[P2(x)-λ(0)D2(x)]t,1D3(x(0))[P3(x)-λ(0)D3(x)]t,x11+x12150,x21+x22250,x11+x2150,x12+x22350,x=(x11,x12,x21,x22)0. that is, (28)maxt0.001(-20.366x11-80.328x12+114.251x21  +36.193x22-2.269)t,0.002(-2.563x11-5.127x12-2.894x21    +4.631x22-12.652)t,0.001  (53.591x11-14.02x12+47.204x21    -1.245x22-8.877)t,x11+x12150,x21+x22250,x11+x2150,x12+x22350,x=(x11,x12,x21,x22)0. Solving this problem, we obtain x(1)=(x11,x12,x21,x22)=(24.165,125.835,25.835,224.165).

Step  3. Let δ, the termination parameter, take the value of 10-3. Since t=0.462>δ the satisfactory levels for x(1) are μ1(z1(x(1)))=P1(x(1))/D1(x(1))=0.527, μ2(z2(x(1)))=P2(x(1))/D2(x(1))=0.419, and μ3(z3(x(1)))=P3(x(1))/D3(x(1))=0.527, and their minimal is λ(1)=min{P1(x(1))/D1(x(1)),P2(x(1))/D2(x(1)),P3(x(1))/D3(x(1))}=0.419. Let r:=r+1.

Step  2. For λ(1)=0.419, we construct problem (29)maxt1D1(x(1))[P1(x)-λ(1)D1(x)]t,1D2(x(1))[P2(x)-λ(1)D2(x)]t,1D3(x(1))[P3(x)-λ(1)D3(x)]t,x11+x12150,x21+x22250,x11+x2150,x12+x22350,x=(x11,x12,x21,x22)0, that is, (30)maxt0.001(-20.785x11-81.585x12+113.832x21+35.355x22-3.107)t,0.002(-2.982x11-5.965x12-4.151x21+4.212x22-14.328)t,0.001(52.753x11-14.439x12+46.785x21-2.502x22-10.972)t,x11+x12150,x21+x22250,x11+x2150,x12+x22350,x=(x11,x12,x21,x22)0.

Solving this problem, we obtain x(2)=(x11,x12,x21,x22)=(26.510,123.490,23.490,226.510).

The results corresponding to five iterations for the problem (25) are given in Table 2. Table 2 shows number of iterations r, the satisfactory levels of the objectives corresponding to solution x(r), and the monotone increasing sequence λ(r).

The results corresponding to five iterations for the problem (25).

Iteration  r x ( r ) μ 1 ( x ( r ) ) μ 2 ( x ( r ) ) μ 3 ( x ( r ) ) λ ( r ) t
r = 0 x ( 0 ) = ( 0,150,50,200 ) 1 0 0 0
r = 1 x ( 1 ) = ( 24.165 , 125.835 , 25.835 , 224.165 ) 0.527 0.419 0.527 0.419 0.462
r = 2 x ( 2 ) = ( 26.51 , 123.49 , 23.49 , 226.51 ) 0.48 0.465 0.574 0.465 0.053
r = 3 x ( 3 ) = ( 26.82,123.18 , 23.18 , 226.82 ) 0.473 0.471 0.58 0.471 0.007
r = 4 x ( 4 ) = ( 26.86,123.14 , 23.14 , 226.86 ) 0.473 0.472 0.58 0.472 0.001
r = 5 x ( 5 ) = ( 26.867,123.133 , 23.133 , 226.867 ) 0.472 0.472 0.581 0.472 0.0004

For r=5 and t=0.0004<δ=10-3 in Step 2, then the current solution x*=x(r)=x(5)=(26.867,123.133,23.133,226.867) is a compromise solution of the problem (25) (“min” operator model), and the values of membership functions are μ1(x(5))=0.472, μ2(x(5))=0.472, and μ3(x(5))=0.581 respectively. The optimal value of max-min problem is λ(r)=λ(5)=0.472 and can also be interpreted as the most basic satisfactory level of each objective in this transportation system can attain. Due to the Pareto-optimality test, this compromise solution is also a Pareto-optimal solution because there does not exist alternative solution of problem (25).

Remark 10.

As known, unimodularity feature is observed in the coefficient matrix of the constraints of transportation problem where the determinant of all the square submatrices is either 0 or +1 or −1. If this feature is not satisfied, then the integer solution does not guarantee and the problem does not fit the standard form of the transportation problem .

In our fuzzy approach, model (13) or max-min model is a linear fractional compromise model and it does not fit the standard form of the transportation problem because of membership constraints μq(zq)λ or multiple-objective functions zq, q=1,,Q. The coefficient matrix of the constraints of MLFTP in a canonical form will not be unimodular, and consequently integer solution does not guarantee. Table 2 shows these results obtained by ignoring unimodularity property or the integrality restrictions. If we want to obtain a strictly integer solution for the given fuzzy approach, integer programming is used to overcome the nonintegrity problem. That is, we must put integer conditions on decision variables in solution algorithm. In this case, to reach an integer compromise Pareto-optimal solution for the problem (25), two iterations are required and the results corresponding to them are given in Table 3.

The results corresponding to two iterations for the problem (25).

Iteration  r x ( r ) μ 1 ( x ( r ) ) μ 2 ( x ( r ) ) μ 3 ( x ( r ) ) λ ( r ) t
r = 0 x ( 0 ) = ( 0,150,50,200 ) 1 0 0 0
r = 1 x ( 1 ) = ( 24 , 126 , 26 , 224 ) 0.530 0.416 0.524 0.416 0.459
r = 2 x ( 2 ) = ( 27 , 123 , 23 , 227 ) 0.470 0.475 0.583 0.470 0.047
Remark 11.

All solutions are obtained by using the GAMS computer package.

5. Conclusion

In this study, MLFTP has been introduced for the first time according to the best of our knowledge. First, we provided a theorem emphasizing the fact that MLFTP always has feasible solution; its set of feasible solutions is bounded, and, hence, MLFTP is always solvable. It is also proposed a fuzzy approach which generates a compromise Pareto-optimal solution for MLFTP by reducing the problem to the Zimmermann’s “min” operator model and then constructing a solution algorithm based on Generalized Dinkelbach’s Algorithm.

By means of Generalized Dinkelbach’s Algorithm, MLFTP with nonlinear structure is reduced to a sequence of linear problems. Using LP is one of the most advantageous aspects of this method. We note that, although choosing linear membership function gives essential cause for this linearization property, using another different shape of membership functions such as hyperbolic and exponential and piecewise-linear, by means of Generalized Dinkelbach’s Algorithm, does not.

Our method generates a weakly Pareto-optimal solution for MLFTP, if the problem has alternative solutions. In this case, by using the Pareto-optimality test, a compromise Pareto-optimal solution is found. Otherwise, our method can directly find a compromise Pareto-optimal solution.

The sequence {λr} for all r0 generated by our algorithm is nondecreasing and bounded above by λ* (λ*=maxxSmin1qQμq(zq(x))), since MLFTP is solvable.

An illustrative example is presented to show our fuzzy approach. As seen, at each iteration LP problems were solved rather than linear fractional ones.

5.2. Future Directions

This paper mainly provided an introduction to MLFTP. Many areas are still needed to be explored and developed in this direction. Some fuzzy approaches—using the goal programming, and/or using the nonlinear membership functions—can be developed for MLFTP, to find its compromise Pareto-optimal solution. Computer codes must be written to be used to solve large-scale applications of the method, such as applications to transportation system problems. Moreover, fuzzy approaches with fuzzy parameters for MLFTP together with different shapes of membership functions and/or their stochastic models, solid transportation problems, network problems, and so forth may become new topics in further research.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

The authors are very indebted to the anonymous referees for their critical suggestions for improvements.

Zadeh L. A. Toward a generalized theory of uncertainty (GTU)- an outline Information Sciences 2005 172 1-2 1 40 2-s2.0-18144388681 10.1016/j.ins.2005.01.017 ZBL1074.94021 Zadeh L. A. Is there a need for fuzzy logic? Information Sciences 2008 178 13 2751 2779 2-s2.0-42749097020 10.1016/j.ins.2008.02.012 ZBL1148.68047 Pal B. B. Gupta S. A genetic algorithm approach to fuzzy goal programming formulation of fractional multiobjective decision making problems Proceedings of the 1st International Conference on Advanced Computing (ICAC '09) December 2009 55 60 2-s2.0-77949382931 10.1109/ICADVC.2009.5378218 Charnes A. Cooper W. W. Programming with linear fractional functionals Naval Research. Logistics Quarterly 1962 9 181 186 Bitran G. R. Novaes A. G. Linear programming with a fractional objective function Operations Research 1973 21 22 29 MR0368741 10.1287/opre.21.1.22 ZBL0259.90046 Kornbluth J. S. H. Steuer R. E. Goal programming with linear fractional criteria European Journal of Operational Research 1981 8 1 58 65 2-s2.0-0019612399 10.1016/0377-2217(81)90029-1 ZBL0486.90077 Kornbluth J. S. H. Steuer R. E. Multiple objective linear fractional programming Management Science 1981 27 9 1024 1039 2-s2.0-0019613641 10.1287/mnsc.27.9.1024 ZBL0467.90064 Nykowski I. Zołkiewski Z. A compromise procedure for the multiple objective linear fractional programming problem European Journal of Operational Research 1985 19 1 91 97 2-s2.0-0021849368 10.1016/0377-2217(85)90312-1 ZBL0555.90098 Tiryaki F. Solution proposals to multi-objective linear fractional programming problem [Ph.D. thesis] 1993 Yildiz Technical University, Institution of Science Luhandjula M. K. Fuzzy approaches for multiple objective linear fractional optimization Fuzzy Sets and Systems 1984 13 1 11 23 2-s2.0-0021423815 10.1016/0165-0114(84)90023-X ZBL0546.90094 Sakawa M. Yumine T. Interactive fuzzy decision-making for multiobjective linear fractional programming problems Large Scale Systems 1983 5 105 113 ZBL0533.90085 Sakawa M. Yano H. An interactive fuzzy satisficing method for multiobjective linear fractional programming problems Fuzzy Sets and Systems 1988 28 2 129 144 2-s2.0-38249028725 10.1016/0165-0114(88)90195-9 ZBL0654.90089 Chakraborty M. Gupta S. Fuzzy mathematical programming for multi objective linear fractional programming problem Fuzzy Sets and Systems 2002 125 3 335 342 2-s2.0-0036466770 10.1016/S0165-0114(01)00060-4 ZBL1014.90085 Bit A. K. Biswal M. P. Alam S. S. Fuzzy programming approach to multicriteria decision making transportation problem Fuzzy Sets and Systems 1992 50 2 135 141 MR1185389 10.1016/0165-0114(92)90212-M ZBL0786.90087 Bit A. K. Biswal M. P. Alam S. S. An additive fuzzy programming model for multiobjective transportation problem Fuzzy Sets and Systems 1993 57 3 313 319 MR1237272 10.1016/0165-0114(93)90026-E ZBL0787.90103 Verma R. Biswal M. P. Biswas A. Fuzzy programming technique to solve multi-objective transportation problems with some non-linear membership functions Fuzzy Sets and Systems 1997 91 1 37 43 2-s2.0-0002115706 10.1016/S0165-0114(96)00148-0 Das S. K. Goswami A. Alam S. S. Multiobjective transportation problem with interval cost, source and destination parameters European Journal of Operational Research 1999 117 1 100 112 2-s2.0-0345633659 10.1016/S0377-2217(98)00044-7 ZBL0998.90071 El-Wahed W. F. A. A multi-objective transportation problem under fuzziness Fuzzy Sets and Systems 2001 117 1 27 33 MR1802773 10.1016/S0165-0114(98)00155-9 ZBL0965.90001 Li L. Lai K. K. A fuzzy approach to the multiobjective transportation problem Computers and Operations Research 1999 27 1 43 57 2-s2.0-0032740796 10.1016/S0305-0548(99)00007-6 Liu S.-T. Kao C. Solving fuzzy transportation problems based on extension principle European Journal of Operational Research 2003 153 3 661 674 2-s2.0-0242490101 10.1016/S0377-2217(02)00731-2 Ammar E. E. Youness E. A. Study on multiobjective transportation problem with fuzzy numbers Applied Mathematics and Computation 2005 166 2 241 253 MR2143784 10.1016/j.amc.2004.04.103 ZBL1099.90049 Abd El-Wahed W. F. Lee S. M. Interactive fuzzy goal programming for multi-objective transportation problems Omega 2006 34 2 158 166 2-s2.0-27744590236 10.1016/j.omega.2004.08.006 Jain M. Saksena P. K. Time minimizing transportation problem with fractional bottleneck objective function Yugoslav Journal of Operations Research 2012 22 115 129 10.2298/YJOR100818004J Bajalinov E. B. Linear Fractional Programming: Theory, Methods, Applications and Software 2003 Boston, Mass, USA Kluwer Academic Zenzerovic Z. Sc D. Beslic S. Optimization of cargo transport with a view to cost efficient operation of container ship Proceedings of the 25th International Conference Information Technology Interfaces 2003 10.1016/j.ins.2008.02.012 Leberling H. On finding compromise solutions in multicriteria problems using the fuzzy min-operator Fuzzy Sets and Systems 1981 6 2 105 118 2-s2.0-43549085961 10.1016/0165-0114(81)90019-1 ZBL0465.90081 Tiryaki F. Interactive compensatory fuzzy programming for decentralized multi-level linear programming (DMLLP) problems Fuzzy Sets and Systems 2006 157 23 3072 3090 2-s2.0-33750362960 10.1016/j.fss.2006.04.001 ZBL1114.90491 Sakawa M. Fuzzy Sets and Interactive Multiobjective Optimization 1993 New York, NY, USA Plenum Press Zimmermann H.-J. Fuzzy programming and linear programming with several objective functions Fuzzy Sets and Systems 1978 1 1 45 55 2-s2.0-49349136235 10.1016/0165-0114(78)90031-3 ZBL0364.90065 Borde J. Crouzeix J. P. Convergence of a Dinkelbach-type algorithm in generalized fractional programming Zeitschrift für Operations Research 1987 31 1 A31 A54 2-s2.0-0023167603 10.1007/BF01258607 ZBL0622.90085 Katagiri H. Sakawa M. Ishii H. Multiobjective fuzzy random linear programming using E-model and possibility measure Proceedings of the Joint 9th IFSA World Congress and 20th NAFIPS International Conference July 2001 2295 2300 2-s2.0-0035792712 Elbenani B. Ferland J. A. Cell Formation Problem Solved Exactly with the Dinkelbach Algorithm, CIRRELT, 2012 Crouzeix J. P. Ferland J. A. Schaible S. An algorithm for generalized fractional programs Journal of Optimization Theory and Applications 1985 47 1 35 49 2-s2.0-0022129898 10.1007/BF00941314 ZBL0548.90083 Ahlatcioglu M. Tiryaki F. Interactive fuzzy programming for decentralized two-level linear fractional programming (DTLLFP) problems Omega 2007 35 4 432 450 2-s2.0-33748901346 10.1016/j.omega.2005.08.005 Rosenthal R. E. GAMS-A User’s Guide 2007 Washington, DC, USA GAMS Development Corporation Ahuja R. K. Magnanti T. L. Orlin J. B. Network Flows: Theory, Algorithms, and Applications 1993 Englewood Cliffs, NJ, USA Prentice Hall