Chuei Yee Chen
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
Chuei Yee Chen has a total of 32 co-authors. Here are the top co-authors by number of shared publications:
- Wah June Leong
Universiti Putra Malaysia
5 shared publications - Adem Kılıçman
Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA, Shah Alam, Malaysia
2 shared publications Hong Seng Sim
Centre for Mathematical Sciences, Universiti Tunku Abdul Rahman, Kajang, Malaysia
2 shared publications- Hong Seng Sim
Univ Tunku Abdul Rahman, Lee Kong Chian Fac Engn & Sci, Dept Math & Actuarial Sci, Sungai Long Campus,Jalan Sungai Long 9, Kajang 43000, Selangor, Malaysia
2 shared publications - Lai Soon Lee
Department of Mathematics and Statistics, Faculty of Science, Universiti Putra Malaysia
2 shared publications - Mansi Verma
Department of Mathematics and Statistics, Faculty of Science, Universiti Putra Malaysia, Serdang 43400 UPM, Selangor, Malaysia
2 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 11 (8) , 26120-26135
Sufficient conditions for the existence of minimizers of fuzzy variational problems with generalized Hukuhara differentiable functions
The study of fuzzy variational problems has received considerable attention in recent years due to their ability to handle the complexity and uncertainty of mathematical models in optimal control and image segmentation problems. The existing literature is focused on necessary conditions for finding minimizers, under the assumption that a minimizer always exists. This study establishes sufficient conditions for the existence of minimizers for generalized Hukuhara (gH) differentiable functions involving multivariable preinvex functions. Preinvexity, being a weaker notion than convexity, nevertheless retains the lower bound property that is sufficient for establishing the existence of minimizers.
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in AIMS Mathematics
- Vol. 11 (8) , 26120-26135
Open AccessSufficient conditions for the existence of minimizers of fuzzy variational problems with generalized Hukuhara differentiable functions
The study of fuzzy variational problems has received considerable attention in recent years due to their ability to handle the complexity and uncertainty of mathematical models in optimal control and image segmentation problems. The existing literature is focused on necessary conditions for finding minimizers, under the assumption that a minimizer always exists. This study establishes sufficient conditions for the existence of minimizers for generalized Hukuhara (gH) differentiable functions involving multivariable preinvex functions. Preinvexity, being a weaker notion than convexity, nevertheless retains the lower bound property that is sufficient for establishing the existence of minimizers.
- Open Access
- 24 February 2025
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2025 (1) , 1-13
Equivalence of coercivity and mean coercivity in higher-order variational integrals with application to minimization
- 24 February 2025
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2025 (1) , 1-13
Open AccessEquivalence of coercivity and mean coercivity in higher-order variational integrals with application to minimization
- Open Access
- 1 April 2024
- Published by Institute of Advanced Engineering and Science in International Journal of Evaluation and Research in Education (IJERE)
- Vol. 13 (2) , 1088-1099
Rasch model assessment of algebraic word problem among year 8 Malaysian students
Word problems continue to be a challenge for students today. All students must meet the prerequisites for problem solving and reasoning skills, which are important components of the critical thinking component of 21st century skills. This study is being conducted to assess students’ strategies for solving word problems with numbers, consecutives, and ages. The Rasch model is used to analyze the item difficulty level of word problems and students’ strategies for solving ten-word problems at various levels of item difficulty in a similar trait. Then, Pearson correlation analysis is used to investigate the item difficulty level in relation to linguistic, algebraic, and arithmetic factors of word problems before evaluating students’ performance on solving these word problems using various strategies. Rasch model found these algebraic word-problem questions are slightly harder for year 8 Malaysian students in relative to an international standard. Meanwhile, the item difficulty of word problems is driven by linguistic and algebra factors where students can score accurately if the word problems contained explicit information. However, the students encountered difficulties while losing their solution strategy when the questions contained implicit data that demanded critical thinking ability.
- 1 April 2024
- Published by Institute of Advanced Engineering and Science in International Journal of Evaluation and Research in Education (IJERE)
- Vol. 13 (2) , 1088-1099
Open AccessRasch model assessment of algebraic word problem among year 8 Malaysian students
Word problems continue to be a challenge for students today. All students must meet the prerequisites for problem solving and reasoning skills, which are important components of the critical thinking component of 21st century skills. This study is being conducted to assess students’ strategies for solving word problems with numbers, consecutives, and ages. The Rasch model is used to analyze the item difficulty level of word problems and students’ strategies for solving ten-word problems at various levels of item difficulty in a similar trait. Then, Pearson correlation analysis is used to investigate the item difficulty level in relation to linguistic, algebraic, and arithmetic factors of word problems before evaluating students’ performance on solving these word problems using various strategies. Rasch model found these algebraic word-problem questions are slightly harder for year 8 Malaysian students in relative to an international standard. Meanwhile, the item difficulty of word problems is driven by linguistic and algebra factors where students can score accurately if the word problems contained explicit information. However, the students encountered difficulties while losing their solution strategy when the questions contained implicit data that demanded critical thinking ability.
- Open Access
- 21 November 2023
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2023 (1) , 1-16
Proximal linearized method for sparse equity portfolio optimization with minimum transaction cost
In this paper, we propose a sparse equity portfolio optimization model that aims at minimizing transaction cost by avoiding small investments while promoting diversification to help mitigate the volatility in the portfolio. The former is achieved by including the $\ell _{0}$ ℓ 0 -norm regularization of the asset weights to promote sparsity. Subjected to a minimum expected return, the proposed model turns out to be an objective function consisting of discontinuous and nonconvex terms. The complexity of the model calls for proximal method, which allows us to handle the objective terms separately via the corresponding proximal operators. We develop an efficient algorithm to find the optimal portfolio and prove its global convergence. The efficiency of the algorithm is demonstrated using real stock data and the model is promising in portfolio selection in terms of generating higher expected return while maintaining good level of sparsity, and thus minimizing transaction cost.
- 21 November 2023
- Published by Springer Nature in Journal of Inequalities and Applications
- Vol. 2023 (1) , 1-16
Open AccessProximal linearized method for sparse equity portfolio optimization with minimum transaction cost
In this paper, we propose a sparse equity portfolio optimization model that aims at minimizing transaction cost by avoiding small investments while promoting diversification to help mitigate the volatility in the portfolio. The former is achieved by including the $\ell _{0}$ ℓ 0 -norm regularization of the asset weights to promote sparsity. Subjected to a minimum expected return, the proposed model turns out to be an objective function consisting of discontinuous and nonconvex terms. The complexity of the model calls for proximal method, which allows us to handle the objective terms separately via the corresponding proximal operators. We develop an efficient algorithm to find the optimal portfolio and prove its global convergence. The efficiency of the algorithm is demonstrated using real stock data and the model is promising in portfolio selection in terms of generating higher expected return while maintaining good level of sparsity, and thus minimizing transaction cost.
- Open Access
- 28 November 2022
- Published by MDPI AG in Sustainability
- Vol. 14 (23) , 15853
Logistics Center Location-Inventory-Routing Problem Optimization: A Systematic Review Using PRISMA Method
A traditional logistics decision model mainly studies the location decision of logistics distribution centers, storage inventory management, vehicle scheduling, and transportation routes. The logistics location-inventory-routing problem (LIRP) is an integrated optimization of the three problems—a comprehensive optimization problem for the whole logistics system. This review paper uses the PRISMA (Preferred Reporting Items for Systematic Reviews and Meta-Analysis) method to review the literature on LIRP systematically. A total of 112 LIRP-related studies published between 2010 and 2021 are reviewed and classified based on 10 abstract and citation databases. The classification includes four aspects: problem characteristics, demand data types, model-based solutions, and application fields. From this systematic review, a few observations are recorded. First, the most popular problems among researchers are the multi-period multi-product problem, the multi-echelon single-link problem, and the multi-depot multi-retailer problem. Based on the objective function, the minimization of total supply chain cost is the primary concern of the LIRP literature. Researchers also favor other problem characteristics such as multi-objective programming, inventory control replenishment policy, and a homogeneous fleet of vehicles. We found that stochastic data are a common factor in an uncertain environment and have broad coverage. When dealing with the LIRP, heuristic and metaheuristic algorithms are the most widely used solution methodologies in the literature. In the application field of LIRP, the perishable products logistics network is mentioned in most applications. Finally, we discuss and emphasize the challenges of and recommendations for future work. This paper provides a systematic review of the literature on LIRP based on the PRISMA method, which contributes vital support and valuable information for researchers interested in LIRP.
- 28 November 2022
- Published by MDPI AG in Sustainability
- Vol. 14 (23) , 15853
Open AccessLogistics Center Location-Inventory-Routing Problem Optimization: A Systematic Review Using PRISMA Method
A traditional logistics decision model mainly studies the location decision of logistics distribution centers, storage inventory management, vehicle scheduling, and transportation routes. The logistics location-inventory-routing problem (LIRP) is an integrated optimization of the three problems—a comprehensive optimization problem for the whole logistics system. This review paper uses the PRISMA (Preferred Reporting Items for Systematic Reviews and Meta-Analysis) method to review the literature on LIRP systematically. A total of 112 LIRP-related studies published between 2010 and 2021 are reviewed and classified based on 10 abstract and citation databases. The classification includes four aspects: problem characteristics, demand data types, model-based solutions, and application fields. From this systematic review, a few observations are recorded. First, the most popular problems among researchers are the multi-period multi-product problem, the multi-echelon single-link problem, and the multi-depot multi-retailer problem. Based on the objective function, the minimization of total supply chain cost is the primary concern of the LIRP literature. Researchers also favor other problem characteristics such as multi-objective programming, inventory control replenishment policy, and a homogeneous fleet of vehicles. We found that stochastic data are a common factor in an uncertain environment and have broad coverage. When dealing with the LIRP, heuristic and metaheuristic algorithms are the most widely used solution methodologies in the literature. In the application field of LIRP, the perishable products logistics network is mentioned in most applications. Finally, we discuss and emphasize the challenges of and recommendations for future work. This paper provides a systematic review of the literature on LIRP based on the PRISMA method, which contributes vital support and valuable information for researchers interested in LIRP.
- Open Access
- 5 October 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (19) , 3638
Sufficient Conditions for the Existence and Uniqueness of Minimizers for Variational Problems under Uncertainty
Fuzzy variational problems have received significant attention over the past decade due to a number of successful applications in fields such as optimal control theory and image segmentation. Current literature on fuzzy variational problems focuses on the necessary optimality conditions for finding the extrema, which have been studied under several differentiability conditions. In this study, we establish the sufficient conditions for the existence of minimizers for fuzzy variational problems under a weaker notion of convexity, namely preinvexity and Buckley–Feuring differentiability. We further discuss their application in a cost minimization problem.
- 5 October 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (19) , 3638
Open AccessSufficient Conditions for the Existence and Uniqueness of Minimizers for Variational Problems under Uncertainty
Fuzzy variational problems have received significant attention over the past decade due to a number of successful applications in fields such as optimal control theory and image segmentation. Current literature on fuzzy variational problems focuses on the necessary optimality conditions for finding the extrema, which have been studied under several differentiability conditions. In this study, we establish the sufficient conditions for the existence of minimizers for fuzzy variational problems under a weaker notion of convexity, namely preinvexity and Buckley–Feuring differentiability. We further discuss their application in a cost minimization problem.
- 2 September 2022
- Published by Taylor & Francis in Optimization
- Vol. 71 (9) , 2595-2611
Scaled parallel iterative method for finding real roots of nonlinear equations
Given a nonconvex minimization problem where the objective function is nonlinear and twice differentiable. To gain more information about the objective function, it is essential to obtain all its stationary points and study the behaviour of these points. Since many nonlinear functions are expressible as polynomials via interpolation, there is a need to devise fast and accurate algorithms in finding root(s) of the interpolating polynomial. Through interval computation, the Weierstrass-like parallel iterative methods are known for their efficiency in finding polynomial zeros. However, these schemes are highly dependent on the midpoints of each interval in generating successive intervals. In this study, we propose a scaling function on some Weierstrass-like parallel iterative methods such that the procedures are less dependent on the generated midpoints, hence allowing a more efficient search for the zeros while reducing the width of the intervals. The proposed procedures with the shifted centres of the enclosing intervals are tested on 120 problems and we compare their efficiency with the existing Weierstrass-like methods in terms of the number of iterations and largest final interval width. The results indicate that the proposed procedures outperform the original procedures, giving more reduction on the final interval width with a lesser number of iterations.
- 2 September 2022
- Published by Taylor & Francis in Optimization
- Vol. 71 (9) , 2595-2611
Scaled parallel iterative method for finding real roots of nonlinear equations
Given a nonconvex minimization problem where the objective function is nonlinear and twice differentiable. To gain more information about the objective function, it is essential to obtain all its stationary points and study the behaviour of these points. Since many nonlinear functions are expressible as polynomials via interpolation, there is a need to devise fast and accurate algorithms in finding root(s) of the interpolating polynomial. Through interval computation, the Weierstrass-like parallel iterative methods are known for their efficiency in finding polynomial zeros. However, these schemes are highly dependent on the midpoints of each interval in generating successive intervals. In this study, we propose a scaling function on some Weierstrass-like parallel iterative methods such that the procedures are less dependent on the generated midpoints, hence allowing a more efficient search for the zeros while reducing the width of the intervals. The proposed procedures with the shifted centres of the enclosing intervals are tested on 120 problems and we compare their efficiency with the existing Weierstrass-like methods in terms of the number of iterations and largest final interval width. The results indicate that the proposed procedures outperform the original procedures, giving more reduction on the final interval width with a lesser number of iterations.
- Open Access
- 7 February 2022
- Published by Wiley in Journal of Function Spaces
- Vol. 2022, 1-14
A Systematic Review on the Advancement in the Study of Fuzzy Variational Problems
The study of fuzzy variational problems has received significant attention over the past decade due to its successful applications in numerous fields, such as image segmentation and optimal control theory. The fuzzy Euler-Lagrange equations provide the necessary optimality conditions for solving fuzzy variational problems explicitly and have been studied under several differentiability conditions. In this paper, we provide a systematic review to recap the history of variational principle in the calculus of variations and compare it with the existing techniques in the fuzzy setting. We begin with the preliminary concepts and definitions of fuzzy theory and scrutinize the Euler-Lagrange’s strategy via systematically searched studies concerning fuzzy variational problems to highlight the importance of improving the existing methods. Finally, we set up the main open problems regarding the limitations of the current approaches, shedding light on future directions.
- 7 February 2022
- Published by Wiley in Journal of Function Spaces
- Vol. 2022, 1-14
Open AccessA Systematic Review on the Advancement in the Study of Fuzzy Variational Problems
The study of fuzzy variational problems has received significant attention over the past decade due to its successful applications in numerous fields, such as image segmentation and optimal control theory. The fuzzy Euler-Lagrange equations provide the necessary optimality conditions for solving fuzzy variational problems explicitly and have been studied under several differentiability conditions. In this paper, we provide a systematic review to recap the history of variational principle in the calculus of variations and compare it with the existing techniques in the fuzzy setting. We begin with the preliminary concepts and definitions of fuzzy theory and scrutinize the Euler-Lagrange’s strategy via systematically searched studies concerning fuzzy variational problems to highlight the importance of improving the existing methods. Finally, we set up the main open problems regarding the limitations of the current approaches, shedding light on future directions.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 18 (6) , 3975-3988
Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
This paper proposes a nonmonotone spectral gradient method for solving large-scale unconstrained optimization problems. The spectral parameter is derived from the eigenvalues of an optimally sized memoryless symmetric rank-one matrix obtained under the measure defined as a ratio of the determinant of updating matrix over its largest eigenvalue. Coupled with a nonmonotone line search strategy where backtracking-type line search is applied selectively, the spectral parameter acts as a stepsize during iterations when no line search is performed and as a milder form of quasi-Newton update when backtracking line search is employed. Convergence properties of the proposed method are established for uniformly convex functions. Extensive numerical experiments are conducted and the results indicate that our proposed spectral gradient method outperforms some standard conjugate-gradient methods.
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 18 (6) , 3975-3988
Nonmonotone spectral gradient method based on memoryless symmetric rank-one update for large-scale unconstrained optimization
This paper proposes a nonmonotone spectral gradient method for solving large-scale unconstrained optimization problems. The spectral parameter is derived from the eigenvalues of an optimally sized memoryless symmetric rank-one matrix obtained under the measure defined as a ratio of the determinant of updating matrix over its largest eigenvalue. Coupled with a nonmonotone line search strategy where backtracking-type line search is applied selectively, the spectral parameter acts as a stepsize during iterations when no line search is performed and as a milder form of quasi-Newton update when backtracking line search is employed. Convergence properties of the proposed method are established for uniformly convex functions. Extensive numerical experiments are conducted and the results indicate that our proposed spectral gradient method outperforms some standard conjugate-gradient methods.
- Open Access
Improving the Convergence of Interval Single-Step Method for Simultaneous Approximation of Polynomial Zeros
This paper describes the extended method of solving real polynomial zeros problems using the single-step method, namely, the interval trio midpoint symmetric single-step (ITMSS) method, which updates the midpoint at each forward-backward-forward step. The proposed algorithm will constantly update the value of the midpoint of each interval of the previous roots before entering the preceding steps; hence, it always generate intervals that decrease toward the polynomial zeros. Theoretically, the proposed method possesses a superior rate of convergence at 16, while the existing methods are known to have, at most, 9. To validate its efficiency, we perform numerical experiments on 52 polynomials, and the results are presented, using performance profiles. The numerical results indicate that the proposed method surpasses the other three methods by fine-tuning the midpoint, which reduces the final interval width upon convergence with fewer iterations.
Open AccessImproving the Convergence of Interval Single-Step Method for Simultaneous Approximation of Polynomial Zeros
This paper describes the extended method of solving real polynomial zeros problems using the single-step method, namely, the interval trio midpoint symmetric single-step (ITMSS) method, which updates the midpoint at each forward-backward-forward step. The proposed algorithm will constantly update the value of the midpoint of each interval of the previous roots before entering the preceding steps; hence, it always generate intervals that decrease toward the polynomial zeros. Theoretically, the proposed method possesses a superior rate of convergence at 16, while the existing methods are known to have, at most, 9. To validate its efficiency, we perform numerical experiments on 52 polynomials, and the results are presented, using performance profiles. The numerical results indicate that the proposed method surpasses the other three methods by fine-tuning the midpoint, which reduces the final interval width upon convergence with fewer iterations.