P vs NP Problem in Portfolio Optimization: Integrating the Markowitz-CAPM Framework with Cardinality Constraints and Black-Scholes Derivative Pricing
Citations
0
Open access
No
Source
arxiv
OpenAlex
Not enriched
arXiv
2603.15652
Abstract
This paper makes the Millennium Prize problem P vs NP operational in quantitative finance by studying cardinality-constrained portfolio selection. Starting from the convex Markowitz mean-variance program with CAPM-based expected returns (Rf plus beta times ERP), we impose a hard sparsity rule that limits the portfolio to K assets out of approximately 94 industry portfolios (Damodaran). The constraint couples discrete subset selection with continuous weight optimization, yielding a mixed-integer quadratic program and an NP-hard search space that grows combinatorially with n and K. We therefore evaluate scalable approximation schemes (greedy screening, Monte Carlo sampling, and genetic algorithms) under a replication-oriented protocol with random-seed control, distributional performance summaries (median and quantiles), runtime profiling, and convergence diagnostics. Dependence structure is documented via correlation and covariance diagnostics and positive-semidefinite checks to link algorithm behavior to the geometry implied by the risk matrix. To support the title's derivatives component, we add a European call option priced by the Black-Scholes model and map it into CAPM-consistent moments using delta-based linearization, validated with a bump test and moneyness/maturity sensitivity. Results highlight how the cardinality constraint reshapes the attainable efficient frontier, why stability and computational-cost trade-offs matter more than single-best runs, and how common-factor dependence can limit diversification in K-sparse solutions. The study provides a reproducible template for NP-hard portfolio optimization with transparent inputs and extensible derivative overlays.
Collections
Add to collection
Paper intelligence
Research analysis
Confidence 95%
42 source chunks
Summary
This paper makes the Millennium Prize problem P vs NP operational in quantitative finance by studying cardinality-constrained portfolio selection. Starting from the convex Markowitz mean-variance program with CAPM-based expected returns (Rf plus beta times ERP), we impose a hard sparsity rule that limits the portfolio to K assets out of approximately 94 industry portfolios (Damodaran). The constraint couples discrete subset selection with continuous weight optimization, yielding a mixed-integer quadratic program and an NP-hard search space that grows combinatorially with n and K. We therefore evaluate scalable approximation schemes (greedy screening, Monte Carlo sampling, and genetic algorithms) under a replication-oriented protocol with random-seed control, distributional performance summaries (median and quantiles), runtime profiling, and convergence diagnostics. Dependence structure is documented via correlation and covariance diagnostics and positive-semidefinite checks to link algorithm behavior to the geometry implied by the risk matrix.
Plain-language summary
This paper makes the Millennium Prize problem P vs NP operational in quantitative finance by studying cardinality-constrained portfolio selection. Starting from the convex Markowitz mean-variance program with CAPM-based expected returns (Rf plus beta times ERP), we impose a hard sparsity rule that limits the portfolio to K assets out of approximately 94 industry portfolios (Damodaran). The constraint couples discrete subset selection with continuous weight optimization, yielding a mixed-integer quadratic program and an NP-hard search space that grows combinatorially with n and K. We therefore evaluate scalable approximation schemes (greedy screening, Monte Carlo sampling, and genetic algorithms) under a replication-oriented protocol with random-seed control, distributional performance summaries (median and quantiles), runtime profiling, and convergence diagnostics. Dependence structure is documented via correlation and covariance diagnostics and positive-semidefinite checks to link algorithm behavior to the geometry implied by the risk matrix.
Research problem
This paper makes the Millennium Prize problem P vs NP operational in quantitative finance by studying cardinality-constrained portfolio selection. 1 P vs NP Problem in Portfolio Optimization: Integrating the Markowitz–CAPM Framework with Cardinality Constraints and Black–Scholes Derivative Pricing Davit Gondauri, ORCID: https://orcid.org/0000-0002-9611-3688 Professor, Doctor of Business Administration, Business & Technology University, Georgia Corresponding author: Davit Gondauri, Dgondauri@gmail.com Type of manuscript: research paper Abstract This study develops an integrated economic–computational framework for portfolio construction that makes the P versus NP divide operational within a financially auditable Markowitz–CAPM setting. Because the resulting search space grows combinatorially (≈C(n,K)), the paper treats scalable optimization as an approximation problem and evaluates practical solution schemes—greedy screening, Monte Carlo sampling over K‑subsets, and genetic algorithms—under a replication‑oriented protocol with random‑seed logging, distributional performance reporting (median/IQR/quantiles), convergence/effort curves, and runtime profiling.
Methodology
To support the title's derivatives component, we add a European call option priced by the Black-Scholes model and map it into CAPM-consistent moments using delta-based linearization, validated with a bump test and moneyness/maturity sensitivity. 1 P vs NP Problem in Portfolio Optimization: Integrating the Markowitz–CAPM Framework with Cardinality Constraints and Black–Scholes Derivative Pricing Davit Gondauri, ORCID: https://orcid.org/0000-0002-9611-3688 Professor, Doctor of Business Administration, Business & Technology University, Georgia Corresponding author: Davit Gondauri, Dgondauri@gmail.com Type of manuscript: research paper Abstract This study develops an integrated economic–computational framework for portfolio construction that makes the P versus NP divide operational within a financially auditable Markowitz–CAPM setting. To ensure empirical transparency, the asset universe is built from approximately n≈94 U.S. industry portfolios from Aswath Damodaran, using levered betas and annualized equity volatilities to calibrate expected returns via μ_i = R_f + β_i·ERP and to construct a fully reconstructible covariance matrix through a single‑index (market‑model) structure. To support financial realism beyond linear assets, the framework is extended to a derivative‑augmented universe by embedding a Black–Scholes European call as an additional instrument, mapped into CAPM‑consistent moments via delta‑based linearization and validated by moneyness–maturity robustness and a bump test (delta vs. repricing). Keywords: P vs NP; Cardinality‑constrained portfolio optimization; Mixed‑integer quadratic programming (MIQP); Markowitz mean–variance; CAPM calibration; Damodaran industry portfolios; Single‑index covariance model; Efficient frontier approximation; Genetic algorithm; Monte Carlo sampling; Reproducibility and seed control; Black–Scholes option overlay; Delta mapping and bump test; Correlation diagnostics and eigenvalue concentration.
Main findings
We therefore evaluate scalable approximation schemes (greedy screening, Monte Carlo sampling, and genetic algorithms) under a replication-oriented protocol with random-seed control, distributional performance summaries (median and quantiles), runtime profiling, and convergence diagnostics. Because the resulting search space grows combinatorially (≈C(n,K)), the paper treats scalable optimization as an approximation problem and evaluates practical solution schemes—greedy screening, Monte Carlo sampling over K‑subsets, and genetic algorithms—under a replication‑oriented protocol with random‑seed logging, distributional performance reporting (median/IQR/quantiles), convergence/effort curves, and runtime profiling. Results demonstrate that (i) the hard cardinality rule materially reshapes attainable efficient frontiers and induces discontinuities relative to the unconstrained benchmark; (ii) heuristic performance must be assessed by stability and compute‑cost trade‑offs rather than single best‑run outcomes; and (iii) under a single‑index covariance, strong common‑factor dependence limits diversification, explaining why high‑β industries and clustered sectors may co‑appear in K‑sparse solutions. This paper uses that tension as its organizing principle: it treats cardinality‑constrained portfolio selection as a concrete instantiation of the P vs NP divide, and then demonstrates how a journal‑grade empirical workflow can be built around it—transparent inputs, auditable covariance construction, reproducible stochastic search, and diagnostics that connect algorithmic behavior to the underlying dependence structure. In this document’s design, CAPM is used as an auditable, reconstructable prior for μ, not as a claim of realized performance.
Key contributions
Contribution 1
Dependence diagnostics (median pairwise correlation, tail correlation shares, eigenvalue concentration, PSD checks) are reported as first‑class outputs to connect algorithmic behavior to the geometry implied by Σ.
Contribution 2
At the same time, it imposes a strong common-factor geometry on dependence; therefore the paper treats correlation diagnostics (median pairwise correlation, tail shares, eigenvalue concentration) as first-class outputs rather than as afterthoughts.
Contribution 3
The seminal contribution formalizes diversification, the efficient frontier, and tangency-portfolio logic under quadratic risk and linear return aggregation (Markowitz, 1952, 1959).
Contribution 4
Interpretability diagnostics include correlation/covariance summaries, eigenvalue concentration, and risk attribution via marginal contribution / Euler allocation.
Contribution 5
Using a first-order (delta-only) linearization, the option is embedded as an additional ‘asset’ with an implied leverage factor: Δ = N(d1) (3.22) 9 L = (Δ·S0)/C (3.23) β_option ≈ L·β_underlying (3.24) σ_option ≈ L·σ_underlying (3.25) μ_option = R_f + β_option·ERP (3.26) The universe is augmented with one additional asset j=option and Σ is expanded via the single-index rule Cov(R_i,R_j)=β_iβ_j Var(R_m).
Contribution 6
Metric Value Median(ρ_ij) over off-diagonals 0.769201 Share(ρ_ij > 0.5) 0.884008 17 Share(ρ_ij < 0) 0.000000 Top eigenvalue share λ1 / trace(Σ) 0.761011 Top-5 eigenvalues share Σ_{k≤5} λk / trace(Σ) 0.813010 min eigenvalue (PSD check; numerical tolerance) -1.816e-15 4.1.8 Portfolio decomposition: risk contributions and factor exposure Beyond headline Sharpe values, we decompose portfolio variance by marginal risk contribution (MRC).
Contribution 7
Risk‑contribution decomposition (variance shares) for the max‑Sharpe K=10 portfolio (top contributors).
Limitations
- 3.3 Covariance and correlation construction (single-index Σ) Because the beta table typically does not provide industry return time series, Σ is constructed via a single- index (market model) approach: R_i = α_i + β_i R_m + ε_i, E[ε_i]=0, Cov(ε_i, R_m)=0 (3.2) Cov(R_i, R_j) = β_i β_j Var(R_m) for i≠j (3.3) The diagonal is matched to Damodaran’s total risk σ_i: Var(R_i) = σ_i^2 = β_i^2 Var(R_m) + σ^2_{ε,i} (3.4) σ^2_{ε,i} = max(0, σ_i^2 − β_i^2 σ_m^2) (3.5) Here σ_m denotes market volatility.
- Note: with CAPM- implied μ, shifting Rf alone does not change Sharpe because (μ−Rf) scales with β·ERP.
- 4.2 Using Heuristic Algorithms for Portfolio Optimization 4.2.1 Monte Carlo search as an approximation scheme 19 Monte Carlo sampling does not guarantee optimality but provides a practical approximation to the efficient frontier.
- Case Asset Weight β μ (CAPM) A Auto & Truck 0.263 1.456 0.101 A Engineering/Construction 0.255 1.210 0.091 A Steel 0.211 1.063 0.085 B Option (Call overlay on Software (Internet)) 0.669 6.430 0.312 B Financial Svcs. (Non- bank & Insurance) 0.138 0.970 0.081 B Brokerage & Investment Banking 0.059 1.171 0.089 Note: Under CAPM-implied μ and a single-index Σ, delta-implied leverage can raise both μ and σ substantially; Sharpe does not necessarily increase.
- Continuous re-optimization step (subset fixed → weights optimized) To avoid the ‘equal-weight only’ limitation in the GA stage, we apply a continuous refinement step after GA selects a subset.
- CAPM‑implied μ is a model‑based expectation, not realized return; the single‑factor Σ simplifies a multi‑factor reality; delta‑only option embedding does not capture the full spectrum of nonlinearity; and heuristics do not guarantee global optimality.
Future work
- Future research directions follow naturally from the presented results. (1) Alternative estimation of Σ (multi‑factor models, shrinkage covariance, or empirical correlations from historical return series) is necessary to assess the dependence of the conclusions on one‑factor geometry. (2) Extending the derivative layer with gamma/vega components and tail‑risk metrics (e.g., CVaR/EVaR) would enable a more realistic integration of nonlinear payoffs. (3) Applying modern MIQP branch‑and‑bound/cutting‑plane strategies to small‑to‑medium instances—paired with explicit optimality‑gap reporting relative to heuristics—would further strengthen optimality evidence. (4) Finally, moving to realized return data and conducting out‑of‑sample evaluation would bridge model‑implied Sharpe proxies to realized performance.
Models and methods
Datasets
Dataset 1
Results demonstrate that (i) the hard cardinality rule materially reshapes attainable efficient frontiers and induces discontinuities relative to the unconstrained benchmark; (ii) heuristic performance must be assessed by stability and compute‑cost trade‑offs rather than single best‑run outcomes; and (iii) under a single‑index covariance, strong common‑factor dependence limits diversification, explaining why high‑β industries and clustered sectors may co‑appear in K‑sparse solutions.
Dataset 2
Later syntheses clarify that mean–variance efficiency is exact under elliptically distributed returns (or quadratic utility) and becomes an approximation otherwise; nevertheless, it remains the canonical benchmark for constrained allocation studies because the objective and constraints are explicit, auditable, and 4 computationally tractable in its unconstrained convex form (Bodie et al., 2021; Elton et al., 2014; Boyd & Vandenberghe, 2004).
Dataset 3
Classical implementations rely on sample covariances, but finite-sample error can destabilize optimized weights; this motivates shrinkage estimators, Bayesian adjustments, and factor-structure approaches that trade bias for variance reduction (Jorion, 1986; Ledoit & Wolf, 2004).
Dataset 4
Monte Carlo sampling offers a conceptually simple approximation scheme: sample feasible subsets and/or weights, evaluate objective values, and retain high-performing portfolios.
Dataset 5
Method-comparison work emphasizes that heuristic credibility depends on replicability: reporting only the best run is statistically fragile. lo sampling offers a conceptually simple approximation scheme: sample feasible subsets and/or weights, evaluate objective values, and retain high-performing portfolios.
Dataset 6
3.6 Algorithms: Greedy, Monte Carlo, Genetic Algorithm, and continuous re-optimization Three search schemes are employed, each with distinct computational profiles: • Greedy (cardinality-aware): rank industries by a score (e.g., CAPM Sharpe proxy μ_i/σ_i or (β_i·ERP)/σ_i) and select the top K; apply repair if needed. • Monte Carlo: sample random K-subsets; generate weights on the simplex (e.g., Dirichlet) and retain portfolios with the best Sharpe (or best objective). • Genetic Algorithm (GA): chromosome z∈{0,1}^n with exactly K ones; selection–crossover–mutation plus a repair operator to enforce Σ z_i=K.
MIQP
Additional implementation details for the results extensions: (i) Convergence/effort reporting is generated by logging the running best Sharpe at fixed evaluation checkpoints for Monte Carlo and at each generation for GA; (ii) the small‑n MIQP benchmark is solved on a reduced universe with a commercial/open solver, and heuristic runs are repeated on the identical reduced universe to compute relative optimality gaps; (iii) GA is reported in two variants—subset‑only (equal weights within subset) and subset+continuous re‑optimization (subset fixed → weights optimized via quadratic program).
Dataset 8
An additional diagnostic benchmark is the industry-level CAPM Sharpe proxy: S_i^{CAPM} = (β_i · ERP) / σ_i (3.18) This proxy is used for screening and scale interpretation, not as a substitute for realized-return Sharpe.
Dataset 9
For each draw, we sample a K-sized subset and Dirichlet weights on that subset.
Dataset 10
This table reports the composition of the maximum‑Sharpe portfolio identified within the Monte Carlo sample under the cardinality constraint (fixed K industries).
Evaluation metrics
Keywords
No graph connections yet.
Sync citations or add papers to shared collections to build this network.
Knowledge graph
Citation network
Explore references, papers that cite this work and related papers in your Codex library.
References
0No references have been linked yet.
Cited by
0No saved paper is currently linked as citing this work.
Related papers
0Add papers to shared collections or enrich their topics to find related work.
Research workspace
Attach the paper PDF, extract its text, classify its contents and create semantic embeddings.
Paper resources
P vs NP Problem in Portfolio Optimization- Integrating the Markowitz–CAPM Framework with Cardinality Constraints and Black–Scholes Derivative Pricing.pdf