Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems
Author
Abstract
Suggested Citation
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.References listed on IDEAS
- Pekka Korhonen & Seppo Salo & Ralph E. Steuer, 1997. "A Heuristic for Estimating Nadir Criterion Values in Multiple Objective Linear Programming," Operations Research, INFORMS, vol. 45(5), pages 751-757, October.
- Kaliszewski, Ignacy & Michalowski, Wojtek, 1999. "Searching for psychologically stable solutions of multiple criteria decision problems," European Journal of Operational Research, Elsevier, vol. 118(3), pages 549-562, November.
- I. Kaliszewski & W. Michalowski, 1997. "Efficient Solutions and Bounds on Tradeoffs," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 381-394, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Ted Ralphs & Matthew Saltzman & Margaret Wiecek, 2006. "An improved algorithm for solving biobjective integer programs," Annals of Operations Research, Springer, vol. 147(1), pages 43-70, October.
- Kaliszewski, Ignacy, 2004. "Out of the mist--towards decision-maker-friendly multiple criteria decision making support," European Journal of Operational Research, Elsevier, vol. 158(2), pages 293-307, October.
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.- Ignacy Kaliszewski, 2024. "On non-Pareto efficiency," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 34(4), pages 81-88.
- A.P. Wierzbicki, 1998. "Reference Point Methods in Vector Optimization and Decision Support," Working Papers ir98017, International Institute for Applied Systems Analysis.
- Krzysztof S. Targiel & Maciej Nowak & Tadeusz Trzaskalik, 2018. "Scheduling non-critical activities using multicriteria 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. 26(3), pages 585-598, September.
- Murat Köksalan & Banu Lokman, 2015. "Finding nadir points in multi-objective integer programs," Journal of Global Optimization, Springer, vol. 62(1), pages 55-77, May.
- Murat Köksalan & Banu Lokman, 2009. "Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(2), pages 191-198, March.
- Alves, Maria João & Costa, João Paulo, 2009. "An exact method for computing the nadir values in multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 198(2), pages 637-646, October.
- Granat, Janusz & Guerriero, Francesca, 2003. "The interactive analysis of the multicriteria shortest path problem by the reference point method," European Journal of Operational Research, Elsevier, vol. 151(1), pages 103-118, November.
- Fereshteh Akbari & Mehrdad Ghaznavi & Esmaile Khorram, 2018. "A Revised Pascoletti–Serafini Scalarization Method for Multiobjective Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 560-590, August.
- Kaliszewski, Ignacy, 2004. "Out of the mist--towards decision-maker-friendly multiple criteria decision making support," European Journal of Operational Research, Elsevier, vol. 158(2), pages 293-307, October.
- Sun, Minghe, 2005. "Some issues in measuring and reporting solution quality of interactive multiple objective programming procedures," European Journal of Operational Research, Elsevier, vol. 162(2), pages 468-483, April.
- Ricardo Landa & Giomara Lárraga & Gregorio Toscano, 2019. "Use of a goal-constraint-based approach for finding the region of interest in multi-objective problems," Journal of Heuristics, Springer, vol. 25(1), pages 107-139, February.
- Luque, M. & Marcenaro-Gutiérrez, O.D. & López-Agudo, L.A., 2015. "On the potential balance among compulsory education outcomes through econometric and multiobjective programming analysis," European Journal of Operational Research, Elsevier, vol. 241(2), pages 527-540.
- Serpil Sayin, 2000. "Optimizing Over the Efficient Set Using a Top-Down Search of Faces," Operations Research, INFORMS, vol. 48(1), pages 65-72, February.
- Hunt, Brian J. & Wiecek, Margaret M. & Hughes, Colleen S., 2010. "Relative importance of criteria in multiobjective programming: A cone-based approach," European Journal of Operational Research, Elsevier, vol. 207(2), pages 936-945, December.
- Jeffrey Schavland & Yupo Chan & Richard A. Raines, 2009. "Information security: Designing a stochastic‐network for throughput and reliability," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(7), pages 625-641, October.
- Jian Hu & Sanjay Mehrotra, 2012. "Robust and Stochastically Weighted Multiobjective Optimization Models and Reformulations," Operations Research, INFORMS, vol. 60(4), pages 936-953, August.
- Özgür Özpeynirci, 2017. "On nadir points of multiobjective integer programming problems," Journal of Global Optimization, Springer, vol. 69(3), pages 699-712, November.
- Shukla, Pradyumn Kumar & Deb, Kalyanmoy, 2007. "On finding multiple Pareto-optimal solutions using classical and evolutionary generating methods," European Journal of Operational Research, Elsevier, vol. 181(3), pages 1630-1652, September.
- Maciej Nowak & Tadeusz Trzaskalik, 2022. "A trade-off multiobjective dynamic programming procedure and its application to project portfolio selection," Annals of Operations Research, Springer, vol. 311(2), pages 1155-1181, April.
- Ehrgott, Matthias & Tenfelde-Podehl, Dagmar, 2003. "Computation of ideal and Nadir values and implications for their use in MCDM methods," European Journal of Operational Research, Elsevier, vol. 151(1), pages 119-139, November.
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:147:y:2003:i:1:p:94-107. 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.