IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v46y1997i2p229-239.html
   My bibliography  Save this article

Optimization under ordinal scales: When is a greedy solution optimal?

Author

Listed:
  • Aleksandar Pekeč

Abstract

Mathematical formulation of an optimization problem often depends on data which can be measured in more than one acceptable way. If the conclusion of optimality depends on the choice of measure, then we should question whether it is meaningful to ask for an optimal solution. If a meaningful optimal solution exists and the objective function depends on data measured on an ordinal scale of measurement, then the greedy algorithm will give such a solution for a wide range of objective functions. Copyright Physica-Verlag 1997

Suggested Citation

  • Aleksandar Pekeč, 1997. "Optimization under ordinal scales: When is a greedy solution optimal?," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 46(2), pages 229-239, June.
    • Handle: RePEc:spr:mathme:v:46:y:1997:i:2:p:229-239
    DOI: 10.1007/BF01217692
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF01217692
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF01217692?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Awi Federgruen & Henri Groenevelt, 1986. "The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality," Operations Research, INFORMS, vol. 34(6), pages 909-918, December.
    Full references (including those not matched with items on IDEAS)

    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.
    1. Jan A. Van Mieghem & Nils Rudi, 2002. "Newsvendor Networks: Inventory Management and Capacity Investment with Discretionary Activities," Manufacturing & Service Operations Management, INFORMS, vol. 4(4), pages 313-335, August.
    2. Awi Federgruen & Nan Yang, 2008. "Selecting a Portfolio of Suppliers Under Demand and Supply Risks," Operations Research, INFORMS, vol. 56(4), pages 916-936, August.
    3. Renato de Matta & Vernon Ning Hsu & Timothy J. Lowe, 1999. "The selection allocation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 707-725, September.
    4. Harris, Shannon L. & May, Jerrold H. & Vargas, Luis G. & Foster, Krista M., 2020. "The effect of cancelled appointments on outpatient clinic operations," European Journal of Operational Research, Elsevier, vol. 284(3), pages 847-860.
    5. Rohit Patel & Can Urgun, 2021. "Costly Inspection and Money Burning in Internal Capital Markets," Working Papers 2021-29, Princeton University. Economics Department..
    6. Awi Federgruen & C. Daniel Guetta & Garud Iyengar, 2018. "Two‐echelon distribution systems with random demands and storage constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(8), pages 594-618, December.
    7. S. Viswanathan, 2007. "An Algorithm for Determining the Best Lower Bound for the Stochastic Joint Replenishment Problem," Operations Research, INFORMS, vol. 55(5), pages 992-996, October.
    8. Niederhoff, Julie A., 2007. "Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions," European Journal of Operational Research, Elsevier, vol. 176(2), pages 941-955, January.
    9. Hyun-soo Ahn & Mehmet Gümüş & Philip Kaminsky, 2007. "Pricing and Manufacturing Decisions When Demand Is a Function of Prices in Multiple Periods," Operations Research, INFORMS, vol. 55(6), pages 1039-1057, December.
    10. Simai He & Jiawei Zhang & Shuzhong Zhang, 2012. "Polymatroid Optimization, Submodularity, and Joint Replenishment Games," Operations Research, INFORMS, vol. 60(1), pages 128-137, February.
    11. Aksin, O. Zeynep & Harker, Patrick T., 2003. "Capacity sizing in the presence of a common shared resource: Dimensioning an inbound call center," European Journal of Operational Research, Elsevier, vol. 147(3), pages 464-483, June.
    12. Dorit Hochbaum, 2007. "Complexity and algorithms for nonlinear optimization problems," Annals of Operations Research, Springer, vol. 153(1), pages 257-296, September.
    13. Pinto, Roberto, 2016. "Stock rationing under a profit satisficing objective," Omega, Elsevier, vol. 65(C), pages 55-68.

    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:spr:mathme:v:46:y:1997:i:2:p:229-239. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.