A note on the properties of the optimal solution(s) of the greed and regret problem

DOI10.1016/J.EJOR.2009.11.017zbMATH Open1181.90153OpenAlexW2062302547MaRDI QIDQ2267682FDOQ2267682

Authors Anshul Sheopuri, Eitan Zemel 

Publication date 1 March 2010

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2009.11.017

zbMATH Keywords

newsvendorcrimefailure rates

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Auctions, bargaining, bidding and selling, and other market models (91B26) Economics of information (91B44)

Recommendations

• On the Greedy Solution of Ordering Problems
• scientific article; zbMATH DE number 3862966
• Optimization under ordinal scales: When is a greedy solution optimal?
• Monotone Comparative Statics
• A note on monotonicity in optimal multiple stopping problems

Cites work

• Selling to the ``newsvendor with a forecast update: analysis of a dual purchase contract
• Strict monotonicity in comparative statics

Cited in

(1)

• Optimize, satisfice, or choose without deliberation? A simple minimax-regret assessment

This page was built for publication: A note on the properties of the optimal solution(s) of the greed and regret problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267682)