Optimizing a linear function over an efficient set
Author
Abstract
Suggested Citation
DOI: 10.1007/s12351-021-00664-z
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
- Piercy, Craig A. & Steuer, Ralph E., 2019. "Reducing wall-clock time for the computation of all efficient extreme points in multiple objective linear programming," European Journal of Operational Research, Elsevier, vol. 277(2), pages 653-666.
- Andreas Löhne & Birgit Rudloff & Firdevs Ulus, 2014. "Primal and dual approximation algorithms for convex vector optimization problems," Journal of Global Optimization, Springer, vol. 60(4), pages 713-736, December.
- J. Fülöp & L. D. Muu, 2000. "Branch-and-Bound Variant of an Outcome-Based Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem," Journal of Optimization Theory and Applications, Springer, vol. 105(1), pages 37-54, April.
- Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2017. "A new method for optimizing a linear function over the efficient set of a multiobjective integer program," European Journal of Operational Research, Elsevier, vol. 260(3), pages 904-919.
- Jorge, Jesús M., 2009. "An algorithm for optimizing a linear function over an integer efficient set," European Journal of Operational Research, Elsevier, vol. 195(1), pages 98-103, May.
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.- Gabriela Kov'av{c}ov'a & Birgit Rudloff, 2018. "Time consistency of the mean-risk problem," Papers 1806.10981, arXiv.org, revised Jan 2020.
- Gabriela Kováčová & Birgit Rudloff, 2022. "Convex projection and convex multi-objective optimization," Journal of Global Optimization, Springer, vol. 83(2), pages 301-327, June.
- Zachary Feinstein & Birgit Rudloff, 2024. "Deep learning the efficient frontier of convex vector optimization problems," Journal of Global Optimization, Springer, vol. 90(2), pages 429-458, October.
- 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.
- Daniel Dörfler, 2022. "On the Approximation of Unbounded Convex Sets by Polyhedra," Journal of Optimization Theory and Applications, Springer, vol. 194(1), pages 265-287, July.
- Alvaro Sierra Altamiranda & Hadi Charkhgard, 2019. "A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 823-840, October.
- Satya Tamby & Daniel Vanderpooten, 2021. "Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 72-85, January.
- Robert Bassett & Khoa Le, 2016. "Multistage Portfolio Optimization: A Duality Result in Conic Market Models," Papers 1601.00712, arXiv.org, revised Jan 2016.
- De Santis, Marianna & Grani, Giorgio & Palagi, Laura, 2020.
"Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming,"
European Journal of Operational Research, Elsevier, vol. 283(1), pages 57-69.
- Marianna De Santis & Giorgio Grani & Laura Palagi, 2019. "Branching with Hyperplanes in the Criterion Space:the Frontier Partitioner Algorithm for Biobjective Integer Programming," DIAG Technical Reports 2019-03, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
- Seyyed Amir Babak Rasmi & Ali Fattahi & Metin Türkay, 2021. "SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems," Annals of Operations Research, Springer, vol. 296(1), pages 841-876, January.
- Wassila Drici & Fatma Zohra Ouail & Mustapha Moulaï, 2018. "Optimizing a linear fractional function over the integer efficient set," Annals of Operations Research, Springer, vol. 267(1), pages 135-151, August.
- Zachary Feinstein & Birgit Rudloff, 2022. "Deep Learning the Efficient Frontier of Convex Vector Optimization Problems," Papers 2205.07077, arXiv.org, revised May 2024.
- David Bergman & Merve Bodur & Carlos Cardonha & Andre A. Cire, 2022. "Network Models for Multiobjective Discrete Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 990-1005, March.
- Jornada, Daniel & Leon, V. Jorge, 2016. "Biobjective robust optimization over the efficient set for Pareto set reduction," European Journal of Operational Research, Elsevier, vol. 252(2), pages 573-586.
- Blanco, Víctor, 2011. "A mathematical programming approach to the computation of the omega invariant of a numerical semigroup," European Journal of Operational Research, Elsevier, vol. 215(3), pages 539-550, December.
- Özarık, Sami Serkan & Lokman, Banu & Köksalan, Murat, 2020. "Distribution based representative sets for multi-objective integer programs," European Journal of Operational Research, Elsevier, vol. 284(2), pages 632-643.
- Zachary Feinstein & Birgit Rudloff, 2017. "A recursive algorithm for multivariate risk measures and a set-valued Bellman’s principle," Journal of Global Optimization, Springer, vol. 68(1), pages 47-69, May.
- Zachary Feinstein & Niklas Hey & Birgit Rudloff, 2023. "Approximating the set of Nash equilibria for convex games," Papers 2310.04176, arXiv.org, revised Apr 2024.
- Doğan, Ilgın & Lokman, Banu & Köksalan, Murat, 2022. "Representing the nondominated set in multi-objective mixed-integer programs," European Journal of Operational Research, Elsevier, vol. 296(3), pages 804-818.
- Fritz Bökler & Sophie N. Parragh & Markus Sinnl & Fabien Tricoire, 2024. "An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(1), pages 263-290, August.
More about this item
Keywords
Multi-objective optimization; Efficient solution; Global optimization; Branch and bound; Efficiency test;All these keywords.
Statistics
Access and download statisticsCorrections
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:spr:operea:v:22:y:2022:i:4:d:10.1007_s12351-021-00664-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.