In this paper, we focus on nonlinear programming problems with cardinality constraints that restrict the number of nonzero components of the decision vector. We start with a straightforward mixed-integer programming reformulation. Inspired by previous papers, the binary restrictions on variables are then relaxed, leading to a large number of stationary points based on the Karush-Kuhn-Tucker optimality conditions. Therefore, we employ so-called binary penalties that penalize the non-binary values in the decision vector. This leads to a desirable reduction in the number of stationary points. In the numerical part, we compare the solution approaches on test instances of a portfolio selection problem.
Branda, Martin, Hendrych, Monika. Penalty method for cardinality constrained optimization problems with an application in portfolio theory. // Central European Journal of Operations Research. – 2026. – DOI: 10.1007/s10100-026-01027-9. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10100-026-01027-9
Branda, Martin, Hendrych, & Monika (2026). Penalty method for cardinality constrained optimization problems with an application in portfolio theory. Central European Journal of Operations Research. https://doi.org/10.1007/s10100-026-01027-9
Branda, et al. “Penalty method for cardinality constrained optimization problems with an application in portfolio theory.” Central European Journal of Operations Research, 2026. doi:10.1007/s10100-026-01027-9.
@article{Branda2026,
title = {Penalty method for cardinality constrained optimization problems with an application in portfolio theory},
author = {Branda and Martin and Hendrych and Monika},
journal = {Central European Journal of Operations Research},
year = {2026},
doi = {10.1007/s10100-026-01027-9},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s10100-026-01027-9}
}
In this paper, we consider cost-sharing problems defined on rooted trees. We refer to these problems as cost-tree problems and to the induced transferable utility cooperative games as irrigation games. We introduce a formal notion of...
Portfolio selection is a critical issue in financial management under uncertainty. In this paper, we propose a complex approach for portfolio selection with quantile return approximation. In particular, we propose a practical workflow...
The transcendental logarithmic (translog) production function is recognised as a flexible functional form for modelling production processes. It accommodates varying elasticities of input substitution and diverse types of...
This study investigates mothership-drone route determination using two optimization approaches: a Mixed Integer Linear Programming (MILP) model based on a discrete hexagonal grid, and a Mixed Integer Nonlinear Programming (MINLP) model...
Over the past few years, the expansion of e-commerce has led to a substantial rise in last-mile delivery operations. Within this scenario, retailers have primarily concentrated on enhancing service performance, frequently neglecting the...