A Revamped Linear Constraint Approach to Quadratic Programming for Mean-Variance

Authors

Odiakosa, Osita Emmanuel

Department of Mathematics and Statistics, Faculty of Science, University of Port Harcourt, Nigeria. (Nigeria)

Iwundu, Mary Paschal

Department of Mathematics and Statistics, Faculty of Science, University of Port Harcourt, Nigeria. (Nigeria)

Orumie, Ukamaka Cynthia

Department of Mathematics and Statistics, Faculty of Science, University of Port Harcourt, Nigeria. (Nigeria)

Article Information

DOI: 10.51244/IJRSI.2026.1309000310

Subject Category: Mathematics and Finance

Volume/Issue: 13/9 | Page No: 3991-4007

Publication Timeline

Submitted: 2026-10-26

Accepted: 2026-10-31

Published: 2026-11-12

Abstract

This study develops a novel design model for mean-variance portfolio analysis. Traditional mean-variance models are largely anchored on normality assumptions and often fail to account for higher-order risks, thereby limiting their efficiency in achieving optimal risk-return tradeoffs. To overcome these limitations, this study proposes a Revamped Linear Constraint Approach to Quadratic Programming for Mean-Variance. The model is built on the principles of linear programming optimization and extends into quadratic programming framework to improve mean-variance portfolio analysis optimization. The framework introduces the Quadratic Lower Maximum (QLM) and Quadratic Global Maximum (QGM) to support convexity decisions and robustness analysis with the Linear Global Maximum (LGM) from linear programming for the estimation of expected mean, covariance and variance. This advancement will provide a more comprehensive approach to risk measurement and enhances the effectiveness of portfolio selection decisions through mean-variance portfolio analysis.

Keywords

Linear Constraints, Quadratic Programming, Portfolio Optimization, and Mean-Variance

Downloads

References

1. Atkinson, A. C., & Donev, A. N. (1992). Optimum experimental designs. Oxford University Press. [Google Scholar] [Crossref]

2. Bellman, R. (1957). Dynamic programming. Princeton, NJ: Princeton University Press. [Google Scholar] [Crossref]

3. Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009). Robust optimization. Princeton University Press. [Google Scholar] [Crossref]

4. Borkowski, J. J., & Valeroso, F. (1997). Robustness of central composite and Box-Behnken designs over classes of posterior models. In Proceedings of the 1996 Joint Statistical Meetings: Section on Physical and Engineering Sciences (pp. 198–203). [Google Scholar] [Crossref]

5. Box, M. J. (1966). A comparison of several current optimization methods, and the use of transformations in constrained problems. The Computer Journal, 9(1), 67–77. https://doi.org/10.1093/comjnl/9.1.67 [Google Scholar] [Crossref]

6. Box, G. E. P., & Wilson, K. B. (1951). On the experimental attainment of optimum conditions. Journal of the Royal Statistical Society: Series B (Methodological), 13(1), 1–45. https://doi.org/10.1111/j.2517-6161.1951.tb00067.x [Google Scholar] [Crossref]

7. Bram, L. G., Ihsan, Y., & den H., D. (2015). A practical guide to robust optimization. [Publisher information if available]. [Google Scholar] [Crossref]

8. Bubeck, S. (2015). Convex optimization: Algorithms and complexity. Foundations and Trends in Machine Learning, 8(3–4), 231–357. https://doi.org/10.1561/2200000050 [Google Scholar] [Crossref]

9. Chen, Y., Chi, Y., & Fan, J. (2019). Gradient descent with random initialization: Fast global convergence for nonconvex phase retrieval. Mathematical Programming, 176(1–2), 5–37. https://doi.org/10.1007/s10107-018-1328-5 [Google Scholar] [Crossref]

10. Chong, E. K. P., & Zak, H. S. (2013). An introduction to optimization (4th ed.). John Wiley & Sons, Inc. [Google Scholar] [Crossref]

11. Dantzig, G. B. (1991). Linear programming. In G. B. Dantzig (Ed.), Linear programming and extensions (pp. 3–15). Princeton University Press. [Google Scholar] [Crossref]

12. Etukudo, U. M., & Umoren, E. J. (2008). A modified super convergent line series algorithm for solving linear programming problems. [Google Scholar] [Crossref]

13. Fedorov, V. V. (1972). Theory of optimal experiments. Academic Press. [Google Scholar] [Crossref]

14. Gabr, W. I. (2015). Quadratic and nonlinear programming problems solving and analysis in fully fuzzy environment. Alexandria Engineering Journal, 54(4), 1067–1075. https://doi.org/10.1016/j.aej.2015.07.005 [Google Scholar] [Crossref]

15. Han, S. P. (1977). A globally convergent method for nonlinear programming. Journal of Optimization Theory and Applications, 22(3), 297–309. https://doi.org/10.1007/BF00932858 [Google Scholar] [Crossref]

16. He, S., Xing, W., & Wang, L. (2014). Successive approximation method for convex quadratic bi-level programming problems via neural networks. Neurocomputing, 133, 479–487. https://doi.org/10.1016/j.neucom.2013.11.009 (doi.org in Bing). [Google Scholar] [Crossref]

17. Hilbert, D. (1897). The theory of algebraic forms. Göttingen: Teubner. [Google Scholar] [Crossref]

18. Hillier, F. S., & Lieberman, G. J. (2014). Introduction to operations research (10th ed.). McGraw-Hill. [Google Scholar] [Crossref]

19. Horvath, A. P. (1980). Potential theory and quadratic programming. In Optimization and control (pp. 45–62). Springer. https://doi.org/10.1007/BFb0092978 [Google Scholar] [Crossref]

20. Hübner, G. (2005). The generalized Treynor ratio. Review of Finance, 9(3), 415–435. https://doi.org/10.1007/s10679-005-7593-9 [Google Scholar] [Crossref]

21. Iancu, D. A., & Trichakis, N. (2014). Robust Multi-Stage Decision Making. Operations Research, 62(3), 591–604. [Google Scholar] [Crossref]

22. Inyama, H. C. (2007). Optimization theory: Linear and quadratic programming. Enugu: Immaculate Publications. [Google Scholar] [Crossref]

23. Iwundu, M. P., & Ebong, D. W. (2014). Modified quick convergent inflow algorithm for solving linear programming problems. International Journal of Statistics and Probability, 3(2), 1–10. [Google Scholar] [Crossref]

24. Jaja, E. I., Etuk, E. H., Iwundu, M. P., & Amos, E. (2021b). Robustness of central composite design and modified central composite design to a missing observation for non-standard models. [Journal name, volume (issue), pages]. [Google Scholar] [Crossref]

25. Kall, P., & Wallace, S. W. (1994). Stochastic programming. Chichester; New York: Wiley. [Google Scholar] [Crossref]

26. Kantorovich, L. V. (1939). Mathematical methods of organizing and planning production [in Russian]. Leningrad: Publication of the Leningrad University. (English translation published in 1960 by Management Science, 6(4), 366–422). [Google Scholar] [Crossref]

27. Kontosakos, N., Papageorgiou, E., & Vlachos, D. (2020). Quadratic programming applications in industrial optimization under uncertainty. International Journal of Production Research, 58(14), 4210–4225. https://doi.org/10.1080/00207543.2019.1680897 [Google Scholar] [Crossref]

28. Kuhn, H. W., & Tucker, A. W. (1951). Nonlinear programming. In J. Neyman (Ed.), Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability (pp. 481–492). Berkeley, CA: University of California Press. [Google Scholar] [Crossref]

29. Lawrence, S., & Storm, J. (n.d.). History of the quadratic equation. Shippensburg University. Retrieved February 21, 2026, from https://webspace.ship.edu [Google Scholar] [Crossref]

30. Lipschutz, S., & Lipson, M. L. (2017). Linear algebra (6th ed.). McGraw-Hill Education (Schaum’s Outline Series). [Google Scholar] [Crossref]

31. Long, D. Z., Sim, M., & Zhou, M. (2019). The Dao of robustness. SSRN. https://ssrn.com/abstract=3375093 [Google Scholar] [Crossref]

32. Luenberger, D. G. (1969). Optimization by vector space methods. New York: John Wiley & Sons. [Google Scholar] [Crossref]

33. Luenberger, D. G., & Ye, Y. (2016). Linear and nonlinear programming (4th ed.). Springer. [Google Scholar] [Crossref]

34. MacTutor History of Mathematics. (n.d.). Quadratic, cubic and quartic equations. University of St Andrews. Retrieved February 21, 2026, from https://mathshistory.st-andrews.ac.uk (mathshistory.st-andrews.ac.uk in Bing). [Google Scholar] [Crossref]

35. Mangasarian, O. L. (1969). Nonlinear programming. Philadelphia: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611970451 [Google Scholar] [Crossref]

36. Markowitz, H. M. (1952). Portfolio selection. The Journal of Finance, 7(1), 77–91. https://doi.org/10.1111/j.1540-6261.1952.tb01525.x [Google Scholar] [Crossref]

37. Markowitz, H. M. (1956). The optimization of a quadratic function subject to linear constraints. Naval Research Logistics Quarterly, 3(1–2), 111–133. https://doi.org/10.1002/nav.3800030110 [Google Scholar] [Crossref]

38. Mayer, J. D. (2005). A tale of two visions: Can a new view of personality help integrate psychology? American Psychologist, 60(4), 294–307. https://doi.org/10.1037/0003-066X.60.4.294 [Google Scholar] [Crossref]

39. Metropolis, N., & Ulam, S. (1949). The Monte Carlo method. Journal of the American Statistical Association, 44(247), 335–341. https://doi.org/10.1080/01621459.1949.10483310 [Google Scholar] [Crossref]

40. Mohajerin Esfahani, P., & Kuhn, D. (2018). Data-driven distributionally robust optimization using the Wasserstein metric: Performance guarantees and tractable reformulations. Mathematical Programming, 171(1–2), 115–166. https://doi.org/10.1007/s10107-017-1172-1 [Google Scholar] [Crossref]

41. Montgomery, D. C. (2017). Design and analysis of experiments (9th ed.). Wiley. [Google Scholar] [Crossref]

42. Moscow Mathematical Papyrus. (n.d.). In History of Math and Technology. Retrieved February 21, 2026, from https://historyofmathandtech.org/moscow-papyrus (historyofmathandtech.org in Bing). [Google Scholar] [Crossref]

43. Netrapalli, P., Praneeth, N., Sanghavi, S., Anandkumar, A., & Jain, P. (2014). Non-convex robust PCA. Advances in Neural Information Processing Systems (NeurIPS), 27, 1107–1115. [Google Scholar] [Crossref]

44. Nesterov, Y. (2018). Lectures on convex optimization (Vol. 137). Cham: Springer. https://doi.org/10.1007/978-3-319-91578-4 [Google Scholar] [Crossref]

45. Newton, I. (1664/1964). The mathematical papers of Isaac Newton (D. T. Whiteside, Ed.). Cambridge: Cambridge University Press. [Google Scholar] [Crossref]

46. Niazadeh, R., Vondrák, J., & Wong, J. (2018). Optimal bounds for non-monotone submodular maximization. Proceedings of the 29th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2072–2091. https://doi.org/10.1137/1.9781611975036.136 [Google Scholar] [Crossref]

47. Nwanya, C. J., Mbachu, H. I., & Dozie, K. C. N. (2020). Design optimality criteria of reduced models for variations of central composite design. Archives of Current Research International, 19(4), 1–7. https://doi.org/10.9734/acri/2019/v19i430164 [Google Scholar] [Crossref]

48. Ogboi, C., Adeyemi, T., & Okon, E. (2025). Linear programming applications in investment and loan portfolios. African Journal of Finance, 17(1), 88–104. [Google Scholar] [Crossref]

49. Oladejo, M. O., Adepoju, A. A., & Akinola, O. (2020). Linear programming approach to portfolio optimization in data-limited markets. International Journal of Finance and Accounting, 9(2), 45–53. [Google Scholar] [Crossref]

50. Onukogu, I. B., & Chigbu, P. E. (2002). Super convergent line series (in optimal design of experiment and mathematical programming). Nsukka: AP Express Publishing. [Google Scholar] [Crossref]

51. Odiakosa, O. E., & Iwundu, M. P. (2013). A quick convergent inflow algorithm for solving linear programming problems. Journal of Statistics Applications & Probability, 2(3), 221–229. [Google Scholar] [Crossref]

52. Papahristonel, D., Pardalos, P. M., & Hearn, D. W. (2005). Optimal portfolio construction via linear programming models. In P. M. Pardalos & T. M. Rassias (Eds.), Mathematics of finance (pp. 1–20). Springer. https://doi.org/10.1007/0-387-23335-0_1 (doi.org in Bing). https://doi.org/10.1057/palgrave.jors.2601765 [Google Scholar] [Crossref]

53. Pliska, R. S. (1994). Solving unconstrained optimization problems; portfolio optimization; the quest for useful mathematics. In Proceedings of the International Congress of Mathematicians (pp. [pages if available]). [Google Scholar] [Crossref]

54. Polyak, B. T. (1998). Convexity of quadratic transformations and its use in control and optimization. Journal of Optimization Theory and Applications, 99(3), 553–583. https://doi.org/10.1023/A:1022637508434 [Google Scholar] [Crossref]

55. Popov, V. M. (1962). Absolute stability of nonlinear systems of automatic control. Automation and Remote Control, 22(8), 857–875. [Google Scholar] [Crossref]

56. Ranasinghe, L. P., Disanayake, A. R., & Cooray, T. M. J. A. (2013). Portfolio optimization using quadratic programming. Proceedings of the International Conference on Business and Information (ICBI), University of Kelaniya, Sri Lanka. Retrieved from https://www.researchgate.net/publication/340731087_Portfolio Optimization using Quadratic programming. [Google Scholar] [Crossref]

57. Rockafellar, R. T. (1986). Saddle points and duality in linear–quadratic programming. Mathematical Programming, 34(1), 1–33. https://doi.org/10.1007/BF01582220 [Google Scholar] [Crossref]

58. Roh, K.-H., Kim, J. Y., & Shin, Y. H. (2017). An optimal consumption and investment problem with quadratic utility and negative wealth constraints. Journal of Inequalities and Applications, 2017(188), 1–18. https://doi.org/10.1186/s13660-017-1469-x [Google Scholar] [Crossref]

59. Sesiano, J. (1982). The origin and development of the quadratic equations in Babylonian, Greek, and early Arabic algebra. Archive for History of Exact Sciences, 26(3), 241–289. https://doi.org/10.1007/BF00348395 [Google Scholar] [Crossref]

60. Sharma, J. K. (2017). Operations research: Theory and applications (6th ed.). New Delhi: Macmillan Publishers India. [Google Scholar] [Crossref]

61. Skelton, R. E., Iwasaki, T., & Grigoriadis, K. (1998). A Unified Algebraic Approach to Linear Control Design. Taylor & Francis. [Google Scholar] [Crossref]

62. Sina, K. P., Martin, S. A., Hansson, A., & Rantzer, A. (2006). Decomposition and projection methods for distributed robustness analysis of interconnected uncertain systems. Automatica, 42(12), 2099–2109. https://doi.org/10.1016/j.automatica.2006.05.018 [Google Scholar] [Crossref]

63. Stowe, D. (2019). Portfolio mathematics with general linear and quadratic constraints. Journal of Mathematical Finance, 9(2), 259–273. https://doi.org/10.4236/jmf.2019.92015 [Google Scholar] [Crossref]

64. Summerscales, O. (2023, November 1). Hitting the jackpot: The birth of the Monte Carlo method. Los Alamos National Laboratory. https://discover.lanl.gov/publications/actinide-research-quarterly/2023-11/monte-carlo-method (discover.lanl.gov in Bing). [Google Scholar] [Crossref]

65. Sun, R., & Luo, Z.-Q. (2016). Guaranteed matrix completion via non-convex factorization. IEEE Transactions on Information Theory, 62(11), 6535–6579. https://doi.org/10.1109/TIT.2016.2598572 [Google Scholar] [Crossref]

66. Sutherland, W. A. (2009). Introduction to metric and topological spaces (2nd ed.). Oxford University Press. [Google Scholar] [Crossref]

67. Sylvester, J. J. (1852). A demonstration of the theorem that every homogeneous quadratic polynomial is reducible by real orthogonal substitutions to the form of a sum of positive and negative squares. Philosophical Magazine, 4(7), 138–142. [Google Scholar] [Crossref]

68. Taghi-Nezhad, N. A., & Taleshian, F. (2018). A solution approach for solving fully fuzzy quadratic programming problems. Journal of Applied Research on Industrial Engineering, 6(2), 143–154. https://doi.org/10.22105/jarie.2018.125716.1064 [Google Scholar] [Crossref]

69. Taha, H. A. (2007). Operations research: An introduction (7th ed.). Pearson Education. [Google Scholar] [Crossref]

70. Teixeira, J. (1968). Nonlinear programming: A survey. Journal of Optimization Theory and Applications, 2(1), 1–20. [Google Scholar] [Crossref]

71. Theil, H. (1965). The information approach to demand analysis. Econometrica, 33(1), 67–87. https://doi.org/10.2307/1911889 [Google Scholar] [Crossref]

72. Toeplitz, O., & Hausdorff, F. (1918). Über einige Aufgaben der Analysis situs [On some problems of analysis situs]. Mathematische Annalen, 79(1–2), 90–103. https://doi.org/10.1007/BF01457129 [Google Scholar] [Crossref]

73. Tsay, R. S. (2005). Analysis of financial time series. Hoboken, NJ: Wiley. [Google Scholar] [Crossref]

74. Ugbe, T. A., & Akpan, S. S. (2014). On optimal solution of boundary and interior support points for solving quadratic programming problems through super convergent line series. [Journal or conference details if available]. [Google Scholar] [Crossref]

75. Umoren, M. U. (2000). Application of optimal design theory to the solution of a constrained optimization problem. Journal of Natural and Applied Sciences, 1(1), 78–89. [Google Scholar] [Crossref]

76. Umoren, M. U. (2009). Application of optimal experimental design theory to the solution of certain class of quadratic programming problems. International Journal of Numerical Mathematics, [volume/issue if available]. [Google Scholar] [Crossref]

77. Umoren, M. U., & Etukudo, I. A. (2010). A modified super convergent line series algorithm for solving unconstrained optimization problems. Journal of Modern Mathematics and Statistics, [volume/issue if available]. [Google Scholar] [Crossref]

78. Vafaeinezhad, M., Kia, R., & Shahnazari-Shahrezaei, P. (2019). Robust optimization of a mathematical model to design a dynamic cell formation problem considering labor utilization. Journal of Industrial Engineering International, 15(2), 237–251. https://doi.org/10.1007/s40092-019-00307-0 [Google Scholar] [Crossref]

79. Vasileios, K., Papadopoulos, A., & Tzouvelekas, V. (2020). Application of quadratic programming in agricultural economics: Resource allocation under risk. Agricultural Economics Review, 21(1), 67–82. [Google Scholar] [Crossref]

80. Voloshinov, V. (2018). Approximate solutions in mathematical programming problems. Journal of Applied and Industrial Mathematics, 12(1), 143–152. https://doi.org/10.1134/S1990478918010143 [Google Scholar] [Crossref]

81. Wikipedia. (n.d.). Leonid Kantorovich. In Wikipedia. Retrieved February 28, 2026, from https://en.wikipedia.org/wiki/Leonid_Kantorovich (en.wikipedia.org in Bing). [Google Scholar] [Crossref]

82. Wilson, R. B. (1963). A simplicial algorithm for concave programming (Doctoral dissertation). Harvard University. [Google Scholar] [Crossref]

83. Wolfe, P. (1959). The simplex method for quadratic programming. Econometrica, 27(3), 382–398. https://doi.org/10.2307/1909449 [Google Scholar] [Crossref]

84. Xu, P., Chen, A., & Tsui, P. W. (2008, April 29). The Black-Litterman model. University of California, Berkeley, Statistics 157 Project Paper. https://www.stat.berkeley.edu/~aldous/157/Papers/BlackLitterman.pdf (stat.berkeley.edu in Bing). [Google Scholar] [Crossref]

85. Yahaya, S., Oyerinde, A. A., & Usman, A. (2011). Modern Portfolio Theory and Investment Analysis. Journal of Business and Finance, 3(2), 45–56. [Google Scholar] [Crossref]

86. Yakubovich, V. A. (1962). Solution of certain matrix inequalities encountered in automatic control theory. Soviet Mathematics Doklady, 3, 620–623. [Google Scholar] [Crossref]

87. Zhao, W., Wang, L., Yin, Y., Wang, B., & Tang, Y. (2018). Sequential quadratic programming enhanced backtracking search algorithm. Frontiers of Computer Science, 12(2), 374–389. https://doi.org/10.1007/s11704-017-6327-9 [Google Scholar] [Crossref]

88. Zhu, J. H., Zhou, H., Wang, C., Zhou, L., Yuan, S. Q., & Zhang, W. H. (2021). A review of topology optimization for additive manufacturing: Status and challenges. Chinese Journal of Aeronautics, 34(1), 91–110. https://doi.org/10.1016/j.cja.2020.09.020 [Google Scholar] [Crossref]

Metrics

Views & Downloads

Similar Articles