Abstract
In previous work, Costa and Alves (J Math Sci 161:(6)820–831, 2009; 2011) have presented Branch & Bound and Branch & Cut techniques that allow for the effective computation of nondominated solutions, associated with reference points, of multi-objective linear fractional programming (MOLFP) problems of medium dimensions (ten objective functions, hundreds of variables and constraints). In this paper we present some results that enhance those computations. Firstly, it is proved that the use of a special kind of achievement scalarizing function guarantees that the computation error does not depend on the dimension of the problem. Secondly, a new cut for the Branch & Cut technique is presented. The proof that this new cut is better than the one in Costa and Alves (2011) is presented, guaranteeing that it reduces the region to explore. Some computational tests to assess the impact of the new cut on the performance of the Branch & Cut technique are presented.
Similar content being viewed by others
References
Charnes, A., Cooper, W.: Programming with linear fractional functions. Nav. Res. Logist. Q. 9, 181–186 (1962)
Costa, J., Alves, M.J.: A reference point technique to compute non-dominated solutions in MOLFP. J. Math. Sci. 161(6), 820–831 (2009)
Costa, J., Alves, M.J.: A branch algorithm, cut, to compute nondominated solutions in MOLFP via reference points. In: Hu, B., Morasch, K., Pickl, S., Siegle, M. (eds.) Operations Research Proceedings 2010: Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), pp. 353–358. Springer (2011)
Ferland, J., Potvin, J.Y.: Generalized fractional programming: algorithms and numerical experimentations. Eur. J. Oper. Res. 20, 92–101 (1985)
Frenk, J., Schaible, S.: Fractional programming, ERIM Report Series Research in Management, ERS-2004-074-LIS. Erasmus Research Institute of Management (2004)
Kornbluth, J., Steuer, R.: Goal Program. Linear Fract. Criteria. Eur. J. Oper. Res. 8, 58–65 (1981)
Kornbluth, J., Steuer, R.: Multiple objective linear fractional programming. Manag. Sci. 27, 1024–1039 (1981)
Lofti, F., Noora, A., Jahanshahlooo, G., Khodabakhshi, M., Payan, A.: A linear programming approach to test efficiency in multi-objective linear fractional programming problems. Appl. Math. Model. 34, 4179–4183 (2010)
Metev, B., Gueorguieva, D.: A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems. Eur. J. Oper. Res. 126, 386–390 (2000)
Schaible, S.: Fractional programming: applications and algorithms. Eur. J. Oper. Res. 7, 111–120 (1981)
Schaible, S., Shi, J.: Fractional programming: the sum-of-ratios case. Optim. Methods Softw. 18, 219–229 (2003)
Stancu-Minasian, I.: Fractional Programming: Theory, Methods and Applications. Kluwer, Dordrecht (1997)
Steuer, R.: Multiple Criteria Optimization: Theory, Computation and Application. Wiley, New York (1986)
Wierzbicki, A.: The use of reference points in multiobjective optimization. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making, Theory and Application, pp. 468–486. Springer, Berlin (1980)
Acknowledgments
The authors would like to thank to two anonymous reviewers for their constructive comments that helped to improve the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
This work has been partially supported by FCT under project grant Pest-C/EEI/UI0308/2011, and by project EMSURE-Energy and Mobility for Sustainable Regions (CENTRO-07-0224-FEDER-002004). We would also like to recognize the support from the Faculty of Economics of University of Coimbra under the initiative “40th Anniversary of FEUC”.
Rights and permissions
About this article
Cite this article
Costa, J.P., Alves, M.J. Enhancing computations of nondominated solutions in MOLFP via reference points. J Glob Optim 57, 617–631 (2013). https://doi.org/10.1007/s10898-013-0074-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-013-0074-x