Pengfei Jiang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Pengfei Jiang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Gino K. Yang
Department of Multimedia Game Development and Application, Hungkuang University, Taichung 433304, Taiwan
1 shared publication - Jinyuan Liu
School of General Studies, Weifang University of Science and Technology, Weifang 262700, China
1 shared publication - Kuo-Chen Hung
Department of Multimedia Game Development and Application, Hungkuang University, Taichung City 433304, Taiwan
1 shared publication - Shr-Shiung Hu
School of Intelligent Manufacturing, Weifang University of Science and Technology, Weifang 262700, China
1 shared publication - Xiao Zhou
School of Mathematics and Physics Teaching Center, Weifang University of Science and Technology, Weifang 262700, China
1 shared publication
Latest Publications
- Open Access
- 12 October 2026
- Published by MDPI AG in AppliedMath
- Vol. 6 (10) , 172
A Corrected and Simplified Solution Procedure for the Integrated Vendor–Buyer Inventory Model of Chung (2013)
This study revisits the integrated vendor–buyer inventory model with backordering analyzed by Chung and clarifies its relationship to the finite-horizon cost-comparison method of Minner. We show that the perturbation arguments used for the continuous decision variables recover the usual first-order stationary conditions in the limit, whereas Minner’s construction is based on adjacent finite-horizon cost comparisons followed by an asymptotic argument. We provide direct global-optimality proofs for the backordering ratio and lot size by completing the square, and an exact forward-difference characterization for the integer number of deliveries. We derive an inequality. If the inequality is strict, then the optimal integer is unique. If equality holds, then two consecutive integers have the same minimum value. Our new formulation is shorter and avoids the rounding trap. Re-evaluation of Chung’s numerical example using unrounded intermediate values gives the unique optimum, while a constructed example illustrates the exact two-integer tie case. We also correct algebraic and notation inconsistencies in the reduced cost expressions. The resulting procedure is shorter, globally justified, and more clearly distinguishes continuous-variable algebraic optimization from discrete cost comparison.
- 12 October 2026
- Published by MDPI AG in AppliedMath
- Vol. 6 (10) , 172
Open AccessA Corrected and Simplified Solution Procedure for the Integrated Vendor–Buyer Inventory Model of Chung (2013)
This study revisits the integrated vendor–buyer inventory model with backordering analyzed by Chung and clarifies its relationship to the finite-horizon cost-comparison method of Minner. We show that the perturbation arguments used for the continuous decision variables recover the usual first-order stationary conditions in the limit, whereas Minner’s construction is based on adjacent finite-horizon cost comparisons followed by an asymptotic argument. We provide direct global-optimality proofs for the backordering ratio and lot size by completing the square, and an exact forward-difference characterization for the integer number of deliveries. We derive an inequality. If the inequality is strict, then the optimal integer is unique. If equality holds, then two consecutive integers have the same minimum value. Our new formulation is shorter and avoids the rounding trap. Re-evaluation of Chung’s numerical example using unrounded intermediate values gives the unique optimum, while a constructed example illustrates the exact two-integer tie case. We also correct algebraic and notation inconsistencies in the reduced cost expressions. The resulting procedure is shorter, globally justified, and more clearly distinguishes continuous-variable algebraic optimization from discrete cost comparison.
- Open Access
- 18 June 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (12) , 2011
Approximated Optimal Solution for Economic Manufacturing Quantity Model
This study investigates the use of the bisection algorithm in inventory models to obtain an approximated optimal solution for the economic manufacturing quantity (EMQ) problem under imperfect production conditions. The objectives are threefold. First, we utilize refined estimations of exponential functions to provide tighter lower and upper bounds for the bisection algorithm. Second, we propose three analytical improvements that simplify the solution process, each supported by rigorous proofs. Third, we incorporate recent results from the literature to further enhance the accuracy of exponential function approximations within the EMQ model. Our improved bounding approach significantly reduces the search interval needed by the bisection method and yields an approximate solution that attains a total cost very close to the true optimum. In a numerical example, the proposed method shrinks the initial search range by over 99% compared to prior methods and achieves a production run length that produces a near-minimal average total cost. These findings demonstrate the effectiveness of the enhanced bounds and provide practical insights for inventory models with imperfect processes.
- 18 June 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (12) , 2011
Open AccessApproximated Optimal Solution for Economic Manufacturing Quantity Model
This study investigates the use of the bisection algorithm in inventory models to obtain an approximated optimal solution for the economic manufacturing quantity (EMQ) problem under imperfect production conditions. The objectives are threefold. First, we utilize refined estimations of exponential functions to provide tighter lower and upper bounds for the bisection algorithm. Second, we propose three analytical improvements that simplify the solution process, each supported by rigorous proofs. Third, we incorporate recent results from the literature to further enhance the accuracy of exponential function approximations within the EMQ model. Our improved bounding approach significantly reduces the search interval needed by the bisection method and yields an approximate solution that attains a total cost very close to the true optimum. In a numerical example, the proposed method shrinks the initial search range by over 99% compared to prior methods and achieves a production run length that produces a near-minimal average total cost. These findings demonstrate the effectiveness of the enhanced bounds and provide practical insights for inventory models with imperfect processes.