• Views 1,519
• Citations 1
• ePub 31
• PDF 611
`Advances in Decision SciencesVolume 2014, Article ID 306456, 7 pageshttp://dx.doi.org/10.1155/2014/306456`
Research Article

## An Improved Method for Solving Multiobjective Integer Linear Fractional Programming Problem

Department of Operational Research, Faculty of Mathematics, Houari Boumediene University of Sciences and Technology, P.O. Box 32, El-Alia Bab Ezzouar, 16111 Algiers, Algeria

Received 10 February 2014; Revised 28 May 2014; Accepted 6 June 2014; Published 1 July 2014

Academic Editor: Shelton Peiris

Copyright © 2014 Meriem Ait Mehdi et al. 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.

#### Abstract

We describe an improvement of Chergui and Moulaï’s method (2008) that generates the whole efficient set of a multiobjective integer linear fractional program based on the branch and cut concept. The general step of this method consists in optimizing (maximizing without loss of generality) one of the fractional objective functions over a subset of the original continuous feasible set; then if necessary, a branching process is carried out until obtaining an integer feasible solution. At this stage, an efficient cut is built from the criteria’s growth directions in order to discard a part of the feasible domain containing only nonefficient solutions. Our contribution concerns firstly the optimization process where a linear program that we define later will be solved at each step rather than a fractional linear program. Secondly, local ideal and nadir points will be used as bounds to prune some branches leading to nonefficient solutions. The computational experiments show that the new method outperforms the old one in all the treated instances.

#### 1. Introduction

In this paper we focus our interest on multiobjective integer linear fractional programming (MOILFP) where several linear fractional objectives (i.e., ratio of two linear functions) are to be optimized simultaneously subject to a set of linear constraints and nonnegative integer variables. The motivation behind this choice comes in particular from the fact that in our knowledge a very few number of papers treating this type of problem were published in the literature  contrary to continuous case which has received much more attention from researchers (see, e.g., ). For the interested reader, Stancu-Minasian  has presented a comprehensive bibliography with 491 entries in addition to his book  containing the state of the art in the theory and practice of fractional programming.

Abbas and Moulaï  and Gupta and Malhotra  have presented each a technique to generate the efficient set of a MOILFP based on the same principle: solving a sequence of integer linear fractional programs (ILFPs) until the stopping criterion they propose is met. The first ILFP solved is defined by optimizing one of the objective functions subject to the entire feasible set; then a cutting plane is recursively added to eliminate the current optimal solution and eventually the solutions lying on an adjacent edge. The choice of this latter makes the main difference between these two methods. Unfortunately, they have both the same inconvenience that is scanning almost the whole search space which is very expensive in time and memory space.

In , Chergui and Moulaï proposed a branch and cut approach to solve MOILFP problems. At each step, a new node is added to the search tree and the corresponding problem defined by optimizing one of the fractional objective functions over a subset of the original continuous feasible set is solved. Two types of nodes are distinguished: those relative to the branching process and are created for the search of integer feasible solutions and those relative to the addition of what the authors called an efficient cut. The purpose of adding such a cut to a given problem is to remove from its feasible domain the optimal solution and eventually a set of nonefficient solutions. A node is fathomed if the corresponding problem is infeasible or if the set of the criteria's growth directions determined to construct the efficient cut is empty. The procedure terminates when all the created nodes have been examined. The major drawback of this method lies in the fact that the integer feasible solutions found during the resolution are not all efficient (the efficiency of a solution is guaranteed only at the end of the procedure; otherwise, it is only potentially efficient). The larger the size of the problem, the greater the number of nonefficient solutions generated and thus the slower the convergence of the algorithm. To overcome this, we will introduce two new node fathoming rules based on the calculation of local ideal and nadir points that will avoid exploring other branches leading to unnecessary solutions. Also, we will give the formulation of the linear program that we propose to solve as subproblem at each node rather than a fractional linear program.

The rest of the paper is organized as follows: in Section 2, we give some definitions and some theoretical results related to our work. In Section 3, we describe in detail the improved method. We present a numerical example in Section 4 followed by a discussion of the results obtained from the computational experiments in Section 5. We conclude in Section 6.

#### 2. Definitions and Previous Results

A multiobjective integer linear fractional program can be written as follows: where , are vectors and , are scalars for ; is a real matrix and .

We assume that is a nonempty compact polyhedron and all denominators are positive everywhere in .

The solution to the problem is to find all solutions that are efficient in the sense of the following definition.

An integer solution is called efficient if there does not exist another integer solution such that for all with at least one strict inequality. The resulting criterion vector is said to be nondominated. The set of efficient solutions of will be denoted by throughout the paper.

The vectors with and with are called, respectively, ideal and nadir points of the problem .

A payoff table (suggested by Benayoun et al. ) is a square matrix of order where its ith row represents values of all objective functions calculated at a point where the ith objective obtained its maximum value. An estimate of the nadir point is obtained by finding the worst objective values in each column. This method gives accurate information only in the biobjective case; otherwise, it may be an over or an underestimation.

We give in the following the results that justify the method described in . We first need to introduce some notations:: the optimal integer solution of the linear fractional program ; note that instead of , one can similarly consider the problem with any of the remaining objectives , . Moreover, in the new method that we will state later, the fractional objective function of will be replaced by a linear one; (resp., ): the set of indices of basic variables (resp., nonbasic variables) of ;: the reduced gradient vector of the ith objective. It is defined by where , , , and are updated values obtained from the optimal simplex tableau of ;

: the set defined by ;

: the set defined by .

Theorem 1. Suppose that at the current integer solution . If is an integer efficient solution in domain then .

For proof, see .

Definition 2. An efficient cut is a constraint added to the model and does not eliminate any feasible efficient integer solutions.

Corollary 3. Suppose that at the current integer solution ; then the following constraint is an efficient cut:

See  for proof.

Proposition 4. If at the current integer solution then is an explored domain.

The proof is also in .

#### 3. Description of the Method

In this section, we describe some improvements that we will bring to Chergui and Moulaï’s method  but first we recall briefly its principle and its limitations.

Let us consider a multiobjective integer linear fractional program in the form of . The method of Chergui and Moulaï manages a search tree consisting of nodes. At each node (say ) the following linear fractional program is solved using Cambini and Martein's method  or the dual simplex method:

where and .(i)If this problem is infeasible, then the node is fathomed.(ii)On the contrary case, if the obtained optimal solution is not integer, a branching process is performed. Otherwise, the set defined above is determined. If it is empty then the node is fathomed; else a new node is created and the corresponding problem is obtained by adding to the efficient cut constructed from .The procedure ends when all the created nodes have been examined.

As it can be seen, the node fathoming rules are reduced to the two following cases: the problem is infeasible and is empty which happens very rarely (see Table 7) during the search process. Since the performance of this method depends, among other things, on its ability to avoid exploring nodes of the search tree leading to nonefficient solutions, we propose to add at each node the two new fathoming conditions given below.(i)The ideal point, say , of the multiobjective linear fractional program is dominated by at least one of the potentially nondominated points already found.(ii)There exists such that , where is the ith component of the original problem's nadir point.

Note that the use of the last rule is more appropriate in the biobjective case since the nadir point can be easily computed using the payoff table.

On the other hand, as we need to generate a feasible solution at each step of the method and not necessarily the solution which optimizes one of the fractional objective functions, we suggest to replace for each node the linear fractional program by the following linear program (we keep the same notation for the new problem): where is the parameter of Seshan and Tikekar’s method  taken at the optimum when the first fractional objective is optimized under the integer feasible set. The idea behind this choice is to start with a solution close to an efficient one (in our case, that with the maximum value of ). However, any linear objective function can be used in since the purpose is to obtain a feasible solution; the only disadvantage is that the starting solution will be any vertex of the feasible set which may increase the iteration number.

Handling linear programs will not only reduce the number of simplex iterations performed but also facilitate the use of the dual simplex algorithm whenever a constraint is added to a node problem.

By taking into account the suggested changes and by adopting the same notations as above, we obtain the following algorithm that generates the entire efficient set of .

The Algorithm

Step  0 (initialization). Denote by the list of untreated problems. Set to the empty set and to the linear program . Compute the nadir point of (for the biobjective case, the payoff table is used and the individual optimization of both fractional objectives is performed by Seshan and Tikekar’s method ).

Step  1 (problem selection and resolution). If is empty, return the efficient set and terminate. Otherwise, select the linear program with the greatest index in . Solve the problem using the simplex or the dual simplex method; remove from and go to Step 2.

Step  2 (Fathoming). If is infeasible, go to Step 1.

If not, let be its optimal solution, (resp., ) the set of indices of basic variables (resp., nonbasic variables) of and the corresponding criterion vector.

If is not dominated, go to Step 3. Else, compute the ideal point of as follows.

The individual optimization of each fractional objective under is done by adding three rows to the optimal tableau of ; the first and second rows correspond, respectively, to the numerator and denominator of the fractional function written in the basis and the last one to the reduced gradient vector of the ith objective (see (2)). The ordinary simplex pivot operations are then applied to the new table's rows except the last one which is modified using (2) until the optimal condition is met; that is, ,  .

If is dominated by the criterion vector of at least one solution of or if there exists such that then fathom the corresponding node and go to Step 1. On the contrary case, go to Step 3.

Step  3 (branching). If is integer, go to Step 4; else select the most fractional variable . Create and add to two problems identical to with the additional constraint in the first one and in the second; go to Step 1.

Step  4 (cut generating). Update : If there does not exist such that the corresponding criterion vector dominates then add to and remove all solutions for which the criterion vector is dominated by .

Determine the set . If is empty, go to Step 1. In case that , generate the incident edge with the greatest number of integer solutions and update ; set . Add to the problem obtained by extending with the efficient cut of (3) and go to Step 1.

#### 4. Numerical Example

Consider the following MOILFP problem:Following the steps described above to solve , we find the efficient set given in Table 2.

During the construction of the search tree, 50 nodes were created: the root node, 36 nodes of the branching process, and 13 of the cutting process; 19 nodes among them were fathomed. Only 17 solutions were generated from a total of 42 feasible solutions (the entire feasible set).

In Table 1, we compare the final results obtained for the present example using Chergui and Moulaï’s method  and its improved version.

Table 1: Comparison between Chergui and Moulai's method and its improved version on this example.

In what follows, we give the calculation details for some nodes of the problem’s search tree.

Node 0. We first calculate the payoff table and thus the nadir point by simply finding the individual optima of both objectives with Seshan and Tikekar’s method. The results obtained are shown in Table 3.

Table 3: Results obtained by Seshan and Tikekar's method.

The nadir point is .

We then define the linear program as , where , , , and is the set of satisfying the three constraints of the problem.

Recall that the objective function of taken here can be replaced by any linear objective function.

Set and . The resolution of gives the optimal solution which is not integer. Since only is fractional this is the variable that we branch on. We obtain the two following subproblems: where .

Node 2. Select from the problem . The resolution of this problem yields the optimal integer solution with the corresponding criterion vector . Then . The set of nonbasic variables and the reduced gradient vectors are given in Table 4.

Table 4: Reduced gradient vectors corresponding to Node 2.

We have . We create a new problem by adding to the constraint . Consider .

Node 18. The potentially nondominated solutions found so far are , , and .

The resolution of gives the optimal solution with the criterion vector which is dominated then remains the same.

We have ; we then fathom the Node 18.

Node 29. The potentially nondominated solutions found so far are , , , and .

The resolution of gives the optimal solution with the criterion vector . This latter is dominated by ; therefore, remains the same. Here, the local ideal point is not dominated so we proceed to the construction of the set : see Table 5.

Table 5: Reduced gradient vectors corresponding to Node 29.

Since we have , we fathom the Node 29.

Node 43. The potentially nondominated solutions found so far are , , , , and .

The resolution of gives the optimal solution with the criterion vector which is dominated; then remains the same.

We have that is dominated by ; we then fathom the Node 43.

#### 5. Computational Results

The method described in Section 3 and the one presented in  (referred in Table 6 as New Algorithm and Old Algorithm, respectively) were implemented in a Matlab 7.0 environment and tested on randomly generated MOILFP problems. The data are uncorrelated integers uniformly distributed in the interval for the numerator and denominator coefficients, for the numerator constant, for the denominator constant, and for constraints coefficients. For each constraint, the right-hand side value was set to % of the sum of its coefficients. For each instance ( is the number of variables, the number of constraints, and the number of objectives), a series of 10 problems were solved. Computational experiments were carried out on a computer with 2,53 GHz Core i3 Processor and 3 GB of memory. Table 6 summarizes the obtained results where mean and maximum number of created nodes (Tree Size), number of efficient solutions (), and execution time in seconds are reported. The x mark in the table refers to more than 2 hours of execution time in the CPU Time column and a number of created nodes of order of millions in Tree Size column.

Table 6: The results obtained by both new and old methods on random MOILFPs.
Table 7: The results of the first type instance concerning the number of saturated nodes using each of the 4 fathoming rules.

Due to the important amount of information to be provided, we have not presented the number of nodes saturated corresponding to each of the four fathoming rules used in our method. However, we can give in Table 7, as an example, what we have found for the 10 problems treated of the first type instance that is with 20 variables, 5 constraints, and 2 objectives.

As expected, the results obtained by the new method are much better compared to those obtained by the original one in all the treated instances. Indeed, the old method takes more than two hours of execution time for a number of variables exceeding twenty whereas the new one does not reach half an hour for sixty variables (972,01 sec. on average). One can also notice the influence of the use of nadir and ideal points in the search tree size; for example, in the biobjective case, the number of nodes of the search tree corresponding to a MOILFP problem with twenty variables is of order of tens of thousands on average for the old method; this number of nodes is attained only for sixty variables and more for the new method. We should also notice that the method we propose is more suited for the biobjective case; this is because, first, the computation of the nadir point can be done quickly using the payoff table and, second, the less calculation performed (two reoptimizations) to obtain the ideal point at each stage.

#### 6. Conclusion

In this paper, we have presented an improvement of Chergui and Moulaï’s method  which generates the whole efficient set of MOILFP problems. One of the main changes that we have made was the addition of two fathoming rules using both ideal and nadir points resulting in a remarkable computational savings. Also, we have proposed to linearize one of the fractional objective functions to solve linear programs as subproblems rather than fractional linear programs which facilitates the use of the dual simplex algorithm and reduces the number of simplex iterations performed. We should finally point out that this method does not require any nonlinear optimization and its tree structure can be exploited for construction of a parallel algorithm to handle large scale problems.

#### Conflict of Interests

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

#### References

1. M. Abbas and M. Moulaï, “Integer linear fractional programming with multiple objective,” Journal of the Italian Operations Research Society, vol. 32, no. 103-104, pp. 15–38, 2002.
2. M. E.-A. Chergui and M. Moulaï, “An exact method for a discrete multiobjective linear fractional optimization,” Journal of Applied Mathematics and Decision Sciences, vol. 2008, Article ID 760191, 12 pages, 2008.
3. R. Gupta and R. Malhotra, “Multi-criteria integer linear fractional programming problem,” Optimization, vol. 35, no. 4, pp. 373–389, 1995.
4. R. Caballero and M. Hernández, “The controlled estimation method in the multiobjective linear fractional problem,” Computers & Operations Research, vol. 31, no. 11, pp. 1821–1832, 2004.
5. A. Cambini, L. Martein, and I. M. Stancu-Minasian, “A survey of bicriteria fractional problems,” Advanced Modeling and Optimization, vol. 1, no. 1, pp. 9–46, 1999.
6. J. P. Costa, “An interative method for multiple objective linear fractional programming problems,” OR Spectrum, vol. 27, no. 4, pp. 633–652, 2005.
7. J. P. Costa, “Computing non-dominated solutions in MOLFP,” European Journal of Operational Research, vol. 181, no. 3, pp. 1464–1475, 2007.
8. R. Dangwal, M. K. Sharma, and P. Singh, “Taylor series solution of multiobjective linear fractional programming problem by vague set,” International Journal of Fuzzy Mathematics and Systems, vol. 2, no. 3, pp. 245–253, 2012.
9. N. Güzel, “A proposal to the solution of multiobjective linear fractional programming problem,” Abstract and Applied Analysis, vol. 2013, Article ID 435030, 4 pages, 2013.
10. J. S. H. Kornbluth and R. E. Steuer, “Multiple objective linear fractional programming,” Management Science, vol. 27, no. 9, pp. 1024–1039, 1981.
11. B. Metev and D. Gueorguieva, “A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems,” European Journal of Operational Research, vol. 126, no. 2, pp. 386–390, 2000.
12. S. F. Tantawy, “A new method for solving bi criterion linear fractional programming problems,” International Journal of Engineering and Innovative Technology, vol. 3, no. 3, pp. 128–133, 2013.
13. E. Valipour, M. A. Yaghoobi, and M. Mashinchi, “An iterative approach to solve multiobjective linear fractional programming problems,” Applied Mathematical Modelling, vol. 38, no. 1, pp. 38–49, 2014.
14. I. M. Stancu-Minasian, “A sixth bibliography of fractional programming,” Optimization, vol. 55, no. 4, pp. 405–428, 2006.
15. I. M. Stancu-Minasian, Fractional Programming: Theory, Methods and Applications, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1997.
16. R. Benayoun, J. de Montgolfier, J. Tergny, and O. Laritchev, “Linear programming with multiple objective functions: step method (stem),” Mathematical Programming, vol. 1, no. 1, pp. 366–375, 1971.
17. A. Cambini and L. Martein, “Equivalence in linear fractional programming,” Optimization, vol. 23, no. 1, pp. 41–51, 1992.
18. C. R. Seshan and V. G. Tikekar, “Algorithms for integer fractional programming,” Journal of the Indian Institute of Science, vol. 62, no. 2, pp. 9–16, 1980.