The DOI matches its Crossref record.
A Minimax Portfolio Selection Rule with Linear Programming Solution
Abstract
A new principle for choosing portfolios based on historical returns data is introduced; the optimal portfolio based on this principle is the solution to a simple linear programming problem. This principle uses minimum return rather than variance as a measure of risk. In particular, the portfolio is chosen that minimizes the maximum loss over all past observation periods, for a given level of return. This objective function avoids the logical problems of a quadratic (nonmonotone) utility function implied by mean-variance portfolio selection rules. The resulting minimax portfolios are diversified; for normal returns data, the portfolios are nearly equivalent to those chosen by a mean-variance rule. Framing the portfolio selection process as a linear optimization problem also makes it feasible to constrain certain decision variables to be integer, or 0-1, valued; this feature facilitates the use of more complex decision-making models, including models with fixed transaction charges and models with Boolean-type constraints on allocations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
DRAWDOWN MEASURE IN PORTFOLIO OPTIMIZATION
CHEKHLOV, A., URYASEV, S., & ZABARANKIN, M. (2005) · International Journal of Theoretical and Applied Finance · doi:10.1142/s0219024905002767 · Cited by 350
Metadata
- Authors
- Young, M. R.
- Venue
- Management Science
- Published
- 1998-05
- Volume
- 44
- Issue
- 5
- Pages
- 673-683
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2111951371
- Cited by
- 405
- References
- 0
- FWCI
- 7.77
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.