Bogdana Stanojević
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
Bogdana Stanojević has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Milan Stanojević
Faculty of Organizational Sciences, University of Belgrade, Serbia
22 shared publications - Mirko Vujošević
Faculty of Organizational Sciences, University of Belgrade, Belgrade, Serbia
3 shared publications - Simona Dzitac
Department of Energy Engineering, Faculty of Energy Engineering and Industrial Management, University of Oradea, 1 Universitatii Str., 410087 Oradea, Romania
3 shared publications Ioan Dzitac
Aurel Vlaicu University of Arad, 310330 Arad, Elena Dragoi 2, Romania
2 shared publications- Ioan Dzitac
Agora University of Oradea
2 shared publications Simona Dzitac
Department of Energy Engineering, University of Oradea, Universitatii 1, 410087 Oradea, Romania
2 shared publications
Latest Publications
- Open Access
- 29 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (13) , 2305
A Scoping Review of Recent Fractional Programming Approaches and Ideas for Future Research
This paper aims to present a review of recent scientific ideas and developments in the field of fractional programming. The survey is designed to be prospective, to enable retrieving conclusions regarding current trends in fractional programming, and covers both theoretical results, and practical applications reported in the literature. We organize the solution approaches in certain categories with respect to their characteristics, emphasizing both similarities and differences among them. We also identify some challenges and research gaps that require further investigation. The main objective of the study is to provide an easy to follow survey of the field to researchers interested in advancing the applicability of fractional programming in various adjacent fields, thus, widening interdisciplinarity. The introspection in the recent literature, and suggestions for further research directions are mainly related to optimization in a fuzzy environment, data envelopment analysis, and multiple objective optimization with fractional objective functions.
- 29 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (13) , 2305
Open AccessA Scoping Review of Recent Fractional Programming Approaches and Ideas for Future Research
This paper aims to present a review of recent scientific ideas and developments in the field of fractional programming. The survey is designed to be prospective, to enable retrieving conclusions regarding current trends in fractional programming, and covers both theoretical results, and practical applications reported in the literature. We organize the solution approaches in certain categories with respect to their characteristics, emphasizing both similarities and differences among them. We also identify some challenges and research gaps that require further investigation. The main objective of the study is to provide an easy to follow survey of the field to researchers interested in advancing the applicability of fractional programming in various adjacent fields, thus, widening interdisciplinarity. The introspection in the recent literature, and suggestions for further research directions are mainly related to optimization in a fuzzy environment, data envelopment analysis, and multiple objective optimization with fractional objective functions.
- Open Access
- 21 January 2026
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 21 (1)
Solution Algorithm Involving Heuristics and Criterion Set Dissection to Solve Large Scale Multicriteria Knapsack Problems
Multiobjective combinatorial optimization is an essential approach for handling trade-offs in complex control and communications systems, when multiple conflicting objectives (performance, cost, reliability) must be counterbalanced. Many well known combinatorial problems can be easier solved by customizing a general approach, namely by employing problem specific algorithms in key points of the general framework. In this paper we adapt the general framework PESA (2020) from continual to the discrete case taking advantage of the particular shapes of both decision and criterion space of combinatorial problems, and replace the exact optimization algorithms with new developed heuristics. The results is an anytime heuristics approach that progressively dissecting the Pareto front and deriving approximated non-dominated points. To test the performances of the approach we customized the algorithms and carried out experiments on multiple criteria multidimensional 0/1 Knapsack problems recalled from the literature. The comparative numerical results reported in the paper support the conclusion that the novel approach has the ability to generate good first-level approximations to the Pareto fronts of the addressed problems in reasonable time.
- 21 January 2026
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 21 (1)
Open AccessSolution Algorithm Involving Heuristics and Criterion Set Dissection to Solve Large Scale Multicriteria Knapsack Problems
Multiobjective combinatorial optimization is an essential approach for handling trade-offs in complex control and communications systems, when multiple conflicting objectives (performance, cost, reliability) must be counterbalanced. Many well known combinatorial problems can be easier solved by customizing a general approach, namely by employing problem specific algorithms in key points of the general framework. In this paper we adapt the general framework PESA (2020) from continual to the discrete case taking advantage of the particular shapes of both decision and criterion space of combinatorial problems, and replace the exact optimization algorithms with new developed heuristics. The results is an anytime heuristics approach that progressively dissecting the Pareto front and deriving approximated non-dominated points. To test the performances of the approach we customized the algorithms and carried out experiments on multiple criteria multidimensional 0/1 Knapsack problems recalled from the literature. The comparative numerical results reported in the paper support the conclusion that the novel approach has the ability to generate good first-level approximations to the Pareto fronts of the addressed problems in reasonable time.
- 18 August 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Information Technology & Decision Making
- Vol. 25 (06) , 1919-1948
Multiple Linear Regression Analysis of Interval Type-2 Fuzzy Observed Data in Full Compliance with the Extension Principle
Modeling regression in fuzzy environment is far from a simple analogy of the classic regression. Numerous papers on fuzzy regression transform the fuzzy optimization problem into a sequence of crisp optimization problems that derive the components of the fuzzy solution. Such approaches generally mislead, since the fuzzy arithmetic and optimization are carried out separately, with no inter-connectivity. Searching for a binder, we learned that they can be unified via a solution concept based on the extension principle. We propose a regression analysis on data represented by interval Type-2 fuzzy numbers aiming to predict outputs in full accordance with the extension principle. The importance of our results can be perceived through: the robustness of the proposed extensions; the applicability of the extension principle to general regression analysis; and the improvement of the predictions expressed by thinner interval Type-2 fuzzy-set-valued outputs due to a “soft-and” aggregation operator.
- 18 August 2025
- Published by World Scientific Pub Co Pte Ltd in International Journal of Information Technology & Decision Making
- Vol. 25 (06) , 1919-1948
Multiple Linear Regression Analysis of Interval Type-2 Fuzzy Observed Data in Full Compliance with the Extension Principle
Modeling regression in fuzzy environment is far from a simple analogy of the classic regression. Numerous papers on fuzzy regression transform the fuzzy optimization problem into a sequence of crisp optimization problems that derive the components of the fuzzy solution. Such approaches generally mislead, since the fuzzy arithmetic and optimization are carried out separately, with no inter-connectivity. Searching for a binder, we learned that they can be unified via a solution concept based on the extension principle. We propose a regression analysis on data represented by interval Type-2 fuzzy numbers aiming to predict outputs in full accordance with the extension principle. The importance of our results can be perceived through: the robustness of the proposed extensions; the applicability of the extension principle to general regression analysis; and the improvement of the predictions expressed by thinner interval Type-2 fuzzy-set-valued outputs due to a “soft-and” aggregation operator.
- Open Access
- 1 November 2024
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 19 (6)
On approaching full fuzzy data envelopment analysis and its validation
We approach the full fuzzy data envelopment analysis (DEA) strictly relying on the extension principle. So far in the literature, fuzzy DEA (that uses fuzzy inputs and outputs but crisp weights) and full fuzzy DEA (that uses fuzzy inputs, outputs and weights) were treated distinctly. However, the crisp weights from fuzzy models only act as crisp weights within optimization, but in fact their feasible values finally describe fuzzy weights. As a consequence, the distinction between full fuzzy models and fuzzy models is due to the distinction between establishing or not an a priori shape for the fuzzy weights. In this paper we advance the idea that the methodologies introduced for fuzzy DEA are valuable for full fuzzy DEA as well; and propose a Monte Carlo simulation algorithm to offer an empirical visualization of the shapes of the fuzzy efficiencies of DMUs in full fuzzy DEA. Such visualization firstly can certify whether a solution approach to a full fuzzy DEA derives solutions complying to the extension principle or not; and secondly discloses the fuzzy shapes of the weights obtained by applying a methodology from fuzzy DEA to solving full fuzzy DEA. The complexity of the proposed algorithm is the same as the solution approach to the crisp DEA model that corresponds to the observed full fuzzy DEA model. We report the numerical results of our experiments, compare them to results found in the recent literature, and discuss the misleading consequences of ignoring the extension principle in the context of full fuzzy DEA. Keywords: data envelopment analysis, efficiency, fuzzy programming.
- 1 November 2024
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 19 (6)
Open AccessOn approaching full fuzzy data envelopment analysis and its validation
We approach the full fuzzy data envelopment analysis (DEA) strictly relying on the extension principle. So far in the literature, fuzzy DEA (that uses fuzzy inputs and outputs but crisp weights) and full fuzzy DEA (that uses fuzzy inputs, outputs and weights) were treated distinctly. However, the crisp weights from fuzzy models only act as crisp weights within optimization, but in fact their feasible values finally describe fuzzy weights. As a consequence, the distinction between full fuzzy models and fuzzy models is due to the distinction between establishing or not an a priori shape for the fuzzy weights. In this paper we advance the idea that the methodologies introduced for fuzzy DEA are valuable for full fuzzy DEA as well; and propose a Monte Carlo simulation algorithm to offer an empirical visualization of the shapes of the fuzzy efficiencies of DMUs in full fuzzy DEA. Such visualization firstly can certify whether a solution approach to a full fuzzy DEA derives solutions complying to the extension principle or not; and secondly discloses the fuzzy shapes of the weights obtained by applying a methodology from fuzzy DEA to solving full fuzzy DEA. The complexity of the proposed algorithm is the same as the solution approach to the crisp DEA model that corresponds to the observed full fuzzy DEA model. We report the numerical results of our experiments, compare them to results found in the recent literature, and discuss the misleading consequences of ignoring the extension principle in the context of full fuzzy DEA. Keywords: data envelopment analysis, efficiency, fuzzy programming.
- Open Access
- 4 January 2024
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 19 (1)
Enhanced Solutions to Intuitionistic Fuzzy Multiobjective Linear Fractional Optimization Problems via Lexicographic Method
Optimization involving fuzzy numbers generally, and intuitionistic fuzzy numbers particularly is more and more an essential part of any computational intelligence method; and might be of interest in modeling fuzzy control systems, or carrying out a fuzzy sensitivity analysis. The recent literature includes many research papers related to both theoretical modelling, and practical implementation of fuzzy decision support systems. Fuzzy optimization is one of the main part in such decisionmaking tools. A realistic solution to a fuzzy optimization problem is always desired, and similarly, a Pareto optimal solution to a multiple objective optimization problem is always a need. In this paper we analyze the shortcomings; and eliminate the weaknesses of a solution approach from the literature proposed by Moges et al. in 2023. Firstly, Moges et al. used an accuracy function to de-fuzzify the original intuitionistic fuzzy optimization problem; then linearized the obtained crisp problem; and finally involved fuzzy goals to solve the derived multiple objective linear problem. We present two faulty key points of their approach, namely the de-fuzzification and linearization steps; prove the inappropriateness of their results; and propose some improvements. The final aim in addressing the first key point is to clarify the border between defuzzifications made in accordance to true theoretical statements, and those made for modeling reasons. The methodological improvement we propose is related to the second key point and it assures that Pareto optimal solutions - highly required in multiple objective optimization - are obtained. To illustrate our point of view, we use a numerical example from the literature, and report better numerical results derived by the improved methodology.
- 4 January 2024
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 19 (1)
Open AccessEnhanced Solutions to Intuitionistic Fuzzy Multiobjective Linear Fractional Optimization Problems via Lexicographic Method
Optimization involving fuzzy numbers generally, and intuitionistic fuzzy numbers particularly is more and more an essential part of any computational intelligence method; and might be of interest in modeling fuzzy control systems, or carrying out a fuzzy sensitivity analysis. The recent literature includes many research papers related to both theoretical modelling, and practical implementation of fuzzy decision support systems. Fuzzy optimization is one of the main part in such decisionmaking tools. A realistic solution to a fuzzy optimization problem is always desired, and similarly, a Pareto optimal solution to a multiple objective optimization problem is always a need. In this paper we analyze the shortcomings; and eliminate the weaknesses of a solution approach from the literature proposed by Moges et al. in 2023. Firstly, Moges et al. used an accuracy function to de-fuzzify the original intuitionistic fuzzy optimization problem; then linearized the obtained crisp problem; and finally involved fuzzy goals to solve the derived multiple objective linear problem. We present two faulty key points of their approach, namely the de-fuzzification and linearization steps; prove the inappropriateness of their results; and propose some improvements. The final aim in addressing the first key point is to clarify the border between defuzzifications made in accordance to true theoretical statements, and those made for modeling reasons. The methodological improvement we propose is related to the second key point and it assures that Pareto optimal solutions - highly required in multiple objective optimization - are obtained. To illustrate our point of view, we use a numerical example from the literature, and report better numerical results derived by the improved methodology.
- Open Access
- 4 December 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (23) , 4864
Empiric Solutions to Full Fuzzy Linear Programming Problems Using the Generalized “min” Operator
Solving optimization problems in a fuzzy environment is an area widely addressed in the recent literature. De-fuzzification of data, construction of crisp more or less equivalent problems, unification of multiple objectives, and solving a single crisp optimization problem are the general descriptions of many procedures that approach fuzzy optimization problems. Such procedures are misleading (since relevant information is lost through de-fuzzyfication and aggregation of more objectives into a single one), but they are still dominant in the literature due to their simplicity. In this paper, we address the full fuzzy linear programming problem, and provide solutions in full accordance with the extension principle. The main contribution of this paper is in modeling the conjunction of the fuzzy sets using the “product” operator instead of “min” within the definition of the solution concept. Our theoretical findings show that using a generalized “min” operator within the extension principle assures thinner shapes to the derived fuzzy solutions compared to those available in the literature. Thinner shapes are always desirable, since such solutions provide the decision maker with more significant information.
- 4 December 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (23) , 4864
Open AccessEmpiric Solutions to Full Fuzzy Linear Programming Problems Using the Generalized “min” Operator
Solving optimization problems in a fuzzy environment is an area widely addressed in the recent literature. De-fuzzification of data, construction of crisp more or less equivalent problems, unification of multiple objectives, and solving a single crisp optimization problem are the general descriptions of many procedures that approach fuzzy optimization problems. Such procedures are misleading (since relevant information is lost through de-fuzzyfication and aggregation of more objectives into a single one), but they are still dominant in the literature due to their simplicity. In this paper, we address the full fuzzy linear programming problem, and provide solutions in full accordance with the extension principle. The main contribution of this paper is in modeling the conjunction of the fuzzy sets using the “product” operator instead of “min” within the definition of the solution concept. Our theoretical findings show that using a generalized “min” operator within the extension principle assures thinner shapes to the derived fuzzy solutions compared to those available in the literature. Thinner shapes are always desirable, since such solutions provide the decision maker with more significant information.
- Open Access
- 3 April 2023
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 18 (2)
Optimization-Based Fuzzy Regression in Full Compliance with the Extension Principle
Business Analytics – which unites Descriptive, Predictive and Prescriptive Analytics – represents an important component in the framework of Big Data. It aims to transform data into information, enabling improvements in making decisions. Within Big Data, optimization is mostly related to the prescriptive analysis, but in this paper, we present one of its applications to a predictive analysis based on regression in fuzzy environment. The tools offered by a regression analysis can be used either to identify the correlation of a dependency between the observed inputs and outputs; or to provide a convenient approximation to the output data set, thus enabling its simplified manipulation. In this paper we introduce a new approach to predict the outputs of a fuzzy in – fuzzy out system through a fuzzy regression analysis developed in full accordance to the extension principle. Within our approach, a couple of mathematical optimization problems are solve for each desired α−level. The optimization models derive the left and right endpoints of the α−cut of the predicted fuzzy output, as minimum and maximum of all crisp values that can be obtained as predicted outputs to at least one regression problem with observed crisp data in the α−cut ranges of the corresponding fuzzy observed data. Relevant examples from the literature are recalled and used to illustrate the theoretical findings.
- 3 April 2023
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 18 (2)
Open AccessOptimization-Based Fuzzy Regression in Full Compliance with the Extension Principle
Business Analytics – which unites Descriptive, Predictive and Prescriptive Analytics – represents an important component in the framework of Big Data. It aims to transform data into information, enabling improvements in making decisions. Within Big Data, optimization is mostly related to the prescriptive analysis, but in this paper, we present one of its applications to a predictive analysis based on regression in fuzzy environment. The tools offered by a regression analysis can be used either to identify the correlation of a dependency between the observed inputs and outputs; or to provide a convenient approximation to the output data set, thus enabling its simplified manipulation. In this paper we introduce a new approach to predict the outputs of a fuzzy in – fuzzy out system through a fuzzy regression analysis developed in full accordance to the extension principle. Within our approach, a couple of mathematical optimization problems are solve for each desired α−level. The optimization models derive the left and right endpoints of the α−cut of the predicted fuzzy output, as minimum and maximum of all crisp values that can be obtained as predicted outputs to at least one regression problem with observed crisp data in the α−cut ranges of the corresponding fuzzy observed data. Relevant examples from the literature are recalled and used to illustrate the theoretical findings.
- 12 November 2022
- Published by Springer Nature
- p. 43-60
Full Fuzzy Fractional Programming Based on the Extension Principle
- 12 November 2022
- Published by Springer Nature
- p. 43-60
Full Fuzzy Fractional Programming Based on the Extension Principle
- 25 September 2022
- Published by Springer Nature
- p. 219-228
Extension-Principle-Based Approach to Least Square Fuzzy Linear Regression
- 25 September 2022
- Published by Springer Nature
- p. 219-228
Extension-Principle-Based Approach to Least Square Fuzzy Linear Regression
- 27 February 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (11) , 5275-5282
Extension principle-based solution approach to full fuzzy multi-objective linear fractional programming
- 27 February 2022
- Published by Springer Nature in Soft Computing
- Vol. 26 (11) , 5275-5282
Extension principle-based solution approach to full fuzzy multi-objective linear fractional programming