Multiparametric sensitivity analysis in programming problem with linear-plus-linear fractional objective function
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Wang, Hsiao-Fan & Huang, Chen-Sheng, 1993. "Multi-parametric analysis of the maximum tolerance in a linear programming problem," European Journal of Operational Research, Elsevier, vol. 67(1), pages 75-81, May.
- Hirche, Joachim, 1996. "A note on programming problems with linear-plus-linear-fractional objective functions," European Journal of Operational Research, Elsevier, vol. 89(1), pages 212-214, February.
- H. C. Joksch, 1964. "Programming with fractional linear objective functions," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 11(2), pages 197-204, June.
- N. Ravi & Richard E. Wendell, 1989. "The Tolerance Approach to Sensitivity Analysis of Matrix Coefficients in Linear Programming," Management Science, INFORMS, vol. 35(9), pages 1106-1119, September.
- Richard E. Wendell, 1985. "The Tolerance Approach to Sensitivity Analysis in Linear Programming," Management Science, INFORMS, vol. 31(5), pages 564-578, May.
- Chadha, S. S., 1993. "Dual of the sum of a linear and linear fractional program," European Journal of Operational Research, Elsevier, vol. 67(1), pages 136-139, May.
- Schaible, Siegfried, 1981. "Fractional programming: Applications and algorithms," European Journal of Operational Research, Elsevier, vol. 7(2), pages 111-120, June.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Ammar, E.E., 2007. "On optimality and duality theorems of nonlinear disjunctive fractional minmax programs," European Journal of Operational Research, Elsevier, vol. 180(3), pages 971-982, August.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Richard E. Wendell, 2004. "Tolerance Sensitivity and Optimality Bounds in Linear Programming," Management Science, INFORMS, vol. 50(6), pages 797-803, June.
- Marmol, A. M. & Puerto, J., 1997. "Special cases of the tolerance approach in multiobjective linear programming," European Journal of Operational Research, Elsevier, vol. 98(3), pages 610-616, May.
- Pereira Borges, Ana Rosa & Henggeler Antunes, Carlos, 2002. "A visual interactive tolerance approach to sensitivity analysis in MOLP," European Journal of Operational Research, Elsevier, vol. 142(2), pages 357-381, October.
- Hirche, Joachim, 1996. "A note on programming problems with linear-plus-linear-fractional objective functions," European Journal of Operational Research, Elsevier, vol. 89(1), pages 212-214, February.
- Filippi, Carlo, 2005. "A fresh view on the tolerance approach to sensitivity analysis in linear programming," European Journal of Operational Research, Elsevier, vol. 167(1), pages 1-19, November.
- Borgonovo, Emanuele & Plischke, Elmar, 2016. "Sensitivity analysis: A review of recent advances," European Journal of Operational Research, Elsevier, vol. 248(3), pages 869-887.
- Harvey J. Greenberg, 1999. "Matrix Sensitivity Analysis from an Interior Solution of a Linear Program," INFORMS Journal on Computing, INFORMS, vol. 11(3), pages 316-327, August.
- Borgonovo, Emanuele & Buzzard, Gregery T. & Wendell, Richard E., 2018. "A global tolerance approach to sensitivity analysis in linear programming," European Journal of Operational Research, Elsevier, vol. 267(1), pages 321-337.
- Hladík, Milan & Popova, Evgenija D., 2015. "Maximal inner boxes in parametric AE-solution sets with linear shape," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 606-619.
- Chakravarti, N. & Wagelmans, A.P.M., 1997. "Calculation of Stability Radii for Combinatorial Optimization Problems," Econometric Institute Research Papers EI 9740/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Michael Best & Xili Zhang, 2012. "The Efficient Frontier for Weakly Correlated Assets," Computational Economics, Springer;Society for Computational Economics, vol. 40(4), pages 355-375, December.
- João Costa & Maria Alves, 2013. "Enhancing computations of nondominated solutions in MOLFP via reference points," Journal of Global Optimization, Springer, vol. 57(3), pages 617-631, November.
- Frenk, J.B.G. & Schaible, S., 2004. "Fractional Programming," Econometric Institute Research Papers ERS-2004-074-LIS, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
- Yasmine Cherfaoui & Mustapha Moulaï, 2021. "Generating the efficient set of MultiObjective Integer Linear plus Linear Fractional Programming Problems," Annals of Operations Research, Springer, vol. 296(1), pages 735-753, January.
- Harold P. Benson, 2006. "Maximizing the ratio of two convex functions over a convex set," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 309-317, June.
- Nilotpal Chakravarti & Albert P.M. Wagelmans, 1997. "Calculation of Stability Radii for Combinatorial Optimization Problems," Tinbergen Institute Discussion Papers 97-106/4, Tinbergen Institute.
- Hinojosa, M.A. & Mármol, A.M., 2011. "Axial solutions for multiple objective linear problems. An application to target setting in DEA models with preferences," Omega, Elsevier, vol. 39(2), pages 159-167, April.
- Luka Neralić & Richard E. Wendell, 2019. "Sensitivity in DEA: an algorithmic approach," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(4), pages 1245-1264, December.
- Osman Ou{g}uz, 2000. "Bounds on the Opportunity Cost of Neglecting Reoptimization in Mathematical Programming," Management Science, INFORMS, vol. 46(7), pages 1009-1012, July.
- Abderrahman Bouhamidi & Mohammed Bellalij & Rentsen Enkhbat & Khalid Jbilou & Marcos Raydan, 2018. "Conditional Gradient Method for Double-Convex Fractional Programming Matrix Problems," Journal of Optimization Theory and Applications, Springer, vol. 176(1), pages 163-177, January.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:160:y:2005:i:1:p:232-241. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.