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

Aleksandar Pekeč ()

Mathematical Methods of Operations Research, 1997, vol. 46, issue 2, 229-239

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

Keywords: Optimization; Measurement Theory; Greedy Algorithms (search for similar items in EconPapers)
Date: 1997
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1007/BF01217692 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:mathme:v:46:y:1997:i:2:p:229-239

Ordering information: This journal article can be ordered from
http://www.springer.com/economics/journal/00186

DOI: 10.1007/BF01217692

Access Statistics for this article

Mathematical Methods of Operations Research is currently edited by Oliver Stein

More articles in Mathematical Methods of Operations Research from Springer, Gesellschaft für Operations Research (GOR), Nederlands Genootschap voor Besliskunde (NGB)
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().