Janusz Miroforidis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Janusz Miroforidis has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Ignacy Kaliszewski
Systems Research Institute Polish Academy of Sciences Poland
10 shared publications - Anna Zawadzka
Department of Medical Physics, Maria Sklodowska-Curie National Research Institute of Oncology, Warsaw, Poland
2 shared publications - Dmitry Podkopaev
Systems Research Institute, Polish Academy of Sciences
2 shared publications - Ester Martín Garzón
University of Almeria
2 shared publications - Ewa M. Bednarczuk
Department of CAD/CAM Systems Design and Computer-Aided Medicine, Faculty of Mathematics and Information Sciences, Warsaw University of Technology, 00-661 Warszawa, Poland
2 shared publications - Ewa Malgorzata Bednarczuk
Faculty of Mathematics and Information Science, Warsaw University of Technology, Warsaw, Poland
2 shared publications
Latest Publications
- 8 September 2025
- Published by Politechnika Wroclawska Oficyna Wydawnicza in Operations Research and Decisions
- Vol. 36 (1) , 1-23
Mean return – standard deviation investing on the fluctuating efficient frontier
The Markowitz model refers to single-period investing. A common practice is using this model for multi-period investing with portfolio rebalancing at specified times. Such investing is sub-optimal compared to dynamic multi-period investing but is much simpler, which matters in practice. Usually, the investor controls the risk implicitly by selecting the desired mean return within the range of mean returns. Next, the investor assesses the risk according to his/her mean return - risk profile. However, this setup does not apply to multi-period investing because the ranges of possible mean returns and the relation between mean return and risk vary from period to period. As a result, the mean return selected in one period can correspond to a different level of risk in the next one. To address this issue, we propose an approach where the investor's risk is assessed relative to the possible mean return range and can be kept relatively consistent throughout the entire investment horizon.
- 8 September 2025
- Published by Politechnika Wroclawska Oficyna Wydawnicza in Operations Research and Decisions
- Vol. 36 (1) , 1-23
Mean return – standard deviation investing on the fluctuating efficient frontier
The Markowitz model refers to single-period investing. A common practice is using this model for multi-period investing with portfolio rebalancing at specified times. Such investing is sub-optimal compared to dynamic multi-period investing but is much simpler, which matters in practice. Usually, the investor controls the risk implicitly by selecting the desired mean return within the range of mean returns. Next, the investor assesses the risk according to his/her mean return - risk profile. However, this setup does not apply to multi-period investing because the ranges of possible mean returns and the relation between mean return and risk vary from period to period. As a result, the mean return selected in one period can correspond to a different level of risk in the next one. To address this issue, we propose an approach where the investor's risk is assessed relative to the possible mean return range and can be kept relatively consistent throughout the entire investment horizon.
- Open Access
- 11 October 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (20) , 9236
Knapsack Balancing via Multiobjectivization
In this paper, we address the aspect of knapsack balancing in the classic knapsack problem. Recognizing that excessive dispersion in the objective function or constraint coefficients of the optimal solution can be undesirable, we propose, when appropriate, to control this effect through problem multiobjectivization. By multiobjectivization, we mean the addition of one or more objective functions that aim to shift the original problem’s optimal solutions towards Pareto optimal solutions of the multiobjectivized problem, reducing the dispersion of the respective coefficients. We detail how the knapsack balance aspect can be incorporated into the standard knapsack problem model and demonstrate the functionality of this enriched model through illustrative examples.
- 11 October 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (20) , 9236
Open AccessKnapsack Balancing via Multiobjectivization
In this paper, we address the aspect of knapsack balancing in the classic knapsack problem. Recognizing that excessive dispersion in the objective function or constraint coefficients of the optimal solution can be undesirable, we propose, when appropriate, to control this effect through problem multiobjectivization. By multiobjectivization, we mean the addition of one or more objective functions that aim to shift the original problem’s optimal solutions towards Pareto optimal solutions of the multiobjectivized problem, reducing the dispersion of the respective coefficients. We detail how the knapsack balance aspect can be incorporated into the standard knapsack problem model and demonstrate the functionality of this enriched model through illustrative examples.
- Open Access
- 18 September 2024
- Published by Vilnius University Press in Informatica
- p. 99-124
Bi-Level Optimization to Enhance Intensity Modulated Radiation Therapy Planning
Intensity Modulated Radiation Therapy is an effective cancer treatment. Models based on the Generalized Equivalent Uniform Dose (gEUD) provide radiation plans with excellent planning target volume coverage and low radiation for organs at risk. However, manual adjustment of the parameters involved in gEUD is required to ensure that the plans meet patient-specific physical restrictions. This paper proposes a radiotherapy planning methodology based on bi-level optimization. We evaluated the proposed scheme in a real patient and compared the resulting irradiation plans with those prepared by clinical planners in hospital devices. The results in terms of efficiency and effectiveness are promising.
- 18 September 2024
- Published by Vilnius University Press in Informatica
- p. 99-124
Open AccessBi-Level Optimization to Enhance Intensity Modulated Radiation Therapy Planning
Intensity Modulated Radiation Therapy is an effective cancer treatment. Models based on the Generalized Equivalent Uniform Dose (gEUD) provide radiation plans with excellent planning target volume coverage and low radiation for organs at risk. However, manual adjustment of the parameters involved in gEUD is required to ensure that the plans meet patient-specific physical restrictions. This paper proposes a radiotherapy planning methodology based on bi-level optimization. We evaluated the proposed scheme in a real patient and compared the resulting irradiation plans with those prepared by clinical planners in hospital devices. The results in terms of efficiency and effectiveness are promising.
- Open Access
- 12 April 2024
- Published by Vilnius University Press in Informatica
- Vol. 35 (2) , 255-282
A General Framework for Providing Interval Representations of Pareto Optimal Outcomes for Large-Scale Bi- and Tri-Criteria MIP Problems
Publisher: Vilnius University Institute of Data Science and Digital Technologies, Journal: Informatica, Title: A General Framework for Providing Interval Representations of Pareto Optimal Outcomes for Large-Scale Bi- and Tri-Criteria MIP Problems, Authors: Grzegorz Filcek, Janusz Miroforidis , The Multi-Objective Mixed-Integer Programming (MOMIP) problem is one of the most challenging. To derive its Pareto optimal solutions one can use the well-known Chebyshev scalarization and Mixed-Integer Programming (MIP) solvers. However, for a large-scale instance of the MOMIP problem, its scalarization may not be solved to optimality, even by state-of-the-art optimization packages, within the time limit imposed on optimization. If a MIP solver cannot derive the optimal solution within the assumed time limit, it provides the optimality gap, which gauges the quality of the approximate solution. However, for the MOMIP case, no information is provided on the lower and upper bounds of the components of the Pareto optimal outcome. For the MOMIP problem with two and three objective functions, an algorithm is proposed to provide the so-called interval representation of the Pareto optimal outcome designated by the weighting vector when there is a time limit on solving the Chebyshev scalarization. Such interval representations can be used to navigate on the Pareto front. The results of several numerical experiments on selected large-scale instances of the multi-objective multidimensional 0–1 knapsack problem illustrate the proposed approach. The limitations and possible enhancements of the proposed method are also discussed.
- 12 April 2024
- Published by Vilnius University Press in Informatica
- Vol. 35 (2) , 255-282
Open AccessA General Framework for Providing Interval Representations of Pareto Optimal Outcomes for Large-Scale Bi- and Tri-Criteria MIP Problems
Publisher: Vilnius University Institute of Data Science and Digital Technologies, Journal: Informatica, Title: A General Framework for Providing Interval Representations of Pareto Optimal Outcomes for Large-Scale Bi- and Tri-Criteria MIP Problems, Authors: Grzegorz Filcek, Janusz Miroforidis , The Multi-Objective Mixed-Integer Programming (MOMIP) problem is one of the most challenging. To derive its Pareto optimal solutions one can use the well-known Chebyshev scalarization and Mixed-Integer Programming (MIP) solvers. However, for a large-scale instance of the MOMIP problem, its scalarization may not be solved to optimality, even by state-of-the-art optimization packages, within the time limit imposed on optimization. If a MIP solver cannot derive the optimal solution within the assumed time limit, it provides the optimality gap, which gauges the quality of the approximate solution. However, for the MOMIP case, no information is provided on the lower and upper bounds of the components of the Pareto optimal outcome. For the MOMIP problem with two and three objective functions, an algorithm is proposed to provide the so-called interval representation of the Pareto optimal outcome designated by the weighting vector when there is a time limit on solving the Chebyshev scalarization. Such interval representations can be used to navigate on the Pareto front. The results of several numerical experiments on selected large-scale instances of the multi-objective multidimensional 0–1 knapsack problem illustrate the proposed approach. The limitations and possible enhancements of the proposed method are also discussed.
- 1 January 2024
- Published by Politechnika Wroclawska Oficyna Wydawnicza in Operations Research and Decisions
- Vol. 34 (4) , 53-66
Approximate solutions to the multiple-choice knapsack problem by multiobjectivization and Chebyshev scalarization
The method BISSA, proposed by Bednarczuk, Miroforidis, and Pyzel, provides approximate solutions to the multiple-choice knapsack problem. To fathom the optimality gap that is left by BISSA, we present a method that starts from the BISSA16 solution and it is able to provide a better approximation and in consequence a tighter optimality gap. Like BISSA, the new method is based on the multiobjectivization of the multiple-choice knapsack problem but instead of the linear scalarization used in BISSA, it makes use of the Chebyshev scalarization. We validate the new method on the same set of problems as the one used to validate BISSA.
- 1 January 2024
- Published by Politechnika Wroclawska Oficyna Wydawnicza in Operations Research and Decisions
- Vol. 34 (4) , 53-66
Approximate solutions to the multiple-choice knapsack problem by multiobjectivization and Chebyshev scalarization
The method BISSA, proposed by Bednarczuk, Miroforidis, and Pyzel, provides approximate solutions to the multiple-choice knapsack problem. To fathom the optimality gap that is left by BISSA, we present a method that starts from the BISSA16 solution and it is able to provide a better approximation and in consequence a tighter optimality gap. Like BISSA, the new method is based on the multiobjectivization of the multiple-choice knapsack problem but instead of the linear scalarization used in BISSA, it makes use of the Chebyshev scalarization. We validate the new method on the same set of problems as the one used to validate BISSA.
- Open Access
A general framework for providing interval representations of Pareto optimal outcomes for large-scale bi- and tri-criteria MIP problems
The Multi-Objective Mixed-Integer Programming (MOMIP) problem is one of the most challenging. To derive its Pareto optimal solutions one can use the well-known Chebyshev scalarization and Mixed-Integer Programming (MIP) solvers. However, for a large-scale instance of the MOMIP problem, its scalarization may not be solved to optimality, even by state-of-the-art optimization packages, within the time limit imposed on the optimization. If a MIP solver cannot derive the optimal solution within the assumed time limit, it provides the optimality gap, which gauges the quality of the approximate solution. However, for the MOMIP case, no information is provided on the lower and upper bounds of the components of the Pareto optimal outcome. For the MOMIP problem with two and three objective functions, an algorithm is proposed to provide the so-called interval representation of the Pareto optimal outcome designated by the weighting vector when there is a time limit on solving the Chebyshev scalarization. Such interval representations can be used to navigate on the Pareto front. The results of several numerical experiments on selected large-scale instances of the multi-objective, multidimensional 0-1 knapsack problem illustrate the proposed approach. The limitations and possible enhancements of the proposed method are also discussed.
Open AccessA general framework for providing interval representations of Pareto optimal outcomes for large-scale bi- and tri-criteria MIP problems
The Multi-Objective Mixed-Integer Programming (MOMIP) problem is one of the most challenging. To derive its Pareto optimal solutions one can use the well-known Chebyshev scalarization and Mixed-Integer Programming (MIP) solvers. However, for a large-scale instance of the MOMIP problem, its scalarization may not be solved to optimality, even by state-of-the-art optimization packages, within the time limit imposed on the optimization. If a MIP solver cannot derive the optimal solution within the assumed time limit, it provides the optimality gap, which gauges the quality of the approximate solution. However, for the MOMIP case, no information is provided on the lower and upper bounds of the components of the Pareto optimal outcome. For the MOMIP problem with two and three objective functions, an algorithm is proposed to provide the so-called interval representation of the Pareto optimal outcome designated by the weighting vector when there is a time limit on solving the Chebyshev scalarization. Such interval representations can be used to navigate on the Pareto front. The results of several numerical experiments on selected large-scale instances of the multi-objective, multidimensional 0-1 knapsack problem illustrate the proposed approach. The limitations and possible enhancements of the proposed method are also discussed.
- Open Access
Bi-Level Optimization to Enhance Intensity Modulated Radiation Therapy Planning
Intensity Modulated Radiation Therapy is an effective cancer treatment. Models based on the Generalized Equivalent Uniform Dose (gEUD) provide radiation plans with excellent planning target volume coverage and low radiation for organs at risk. However, manual adjustment of the parameters involved in gEUD is required to ensure that the plans meet patient-specific physical restrictions. This paper proposes a radiotherapy planning methodology based on bi-level optimization. We evaluated the proposed scheme in a real patient and compared the resulting irradiation plans with those prepared by clinical planners in hospital devices. The results in terms of efficiency and effectiveness are promising.
Open AccessBi-Level Optimization to Enhance Intensity Modulated Radiation Therapy Planning
Intensity Modulated Radiation Therapy is an effective cancer treatment. Models based on the Generalized Equivalent Uniform Dose (gEUD) provide radiation plans with excellent planning target volume coverage and low radiation for organs at risk. However, manual adjustment of the parameters involved in gEUD is required to ensure that the plans meet patient-specific physical restrictions. This paper proposes a radiotherapy planning methodology based on bi-level optimization. We evaluated the proposed scheme in a real patient and compared the resulting irradiation plans with those prepared by clinical planners in hospital devices. The results in terms of efficiency and effectiveness are promising.
- Open Access
Approximate solutions to the multiple-choice knapsack problem by multiobjectivization and Chebyshev scalarization
The method BISSA, proposed by Bednarczuk, Miroforidis, and Pyzel, provides approximate solutions to the multiple-choice knapsack problem. To fathom the optimality gap that is left by BISSA, we present a method that starts from the BISSA solution and it is able to provide a better approximation and in consequence a tighter optimality gap. Like BISSA, the new method is based on the multiobjectivization of the multiple-choice knapsack but instead of the linear scalarization used in BISSA, it makes use of the Chebyshev scalarization. We validate the new method on the same set of problems used to validate BISSA.
Open AccessApproximate solutions to the multiple-choice knapsack problem by multiobjectivization and Chebyshev scalarization
The method BISSA, proposed by Bednarczuk, Miroforidis, and Pyzel, provides approximate solutions to the multiple-choice knapsack problem. To fathom the optimality gap that is left by BISSA, we present a method that starts from the BISSA solution and it is able to provide a better approximation and in consequence a tighter optimality gap. Like BISSA, the new method is based on the multiobjectivization of the multiple-choice knapsack but instead of the linear scalarization used in BISSA, it makes use of the Chebyshev scalarization. We validate the new method on the same set of problems used to validate BISSA.
- 6 June 2022
- Published by Springer Nature in Operational Research
- Vol. 22 (5) , 5617-5673
Probing the Pareto front of a large-scale multiobjective problem with a MIP solver
- 6 June 2022
- Published by Springer Nature in Operational Research
- Vol. 22 (5) , 5617-5673
Probing the Pareto front of a large-scale multiobjective problem with a MIP solver
- 3 February 2022
- Published by Wiley in International Transactions in Operational Research
- Vol. 30 (5) , 2395-2414
Expected mean return—standard deviation efficient frontier approximation with low‐cardinality portfolios in the presence of the risk‐free asset
- 3 February 2022
- Published by Wiley in International Transactions in Operational Research
- Vol. 30 (5) , 2395-2414
Expected mean return—standard deviation efficient frontier approximation with low‐cardinality portfolios in the presence of the risk‐free asset