We use an analytical algorithm to show that the similarity measure based on the radius of gyration, still suffers from unresolved pattern recognition dilemmas. We improve the results of the radius of gyration with the y axis to prove that it is independent of the height of the trapezoidal fuzzy number, which is the key factor to constructing our counterexample. We also show that a previously developed counterexample contained questionable results. Our findings demonstrate that relying on only a few similarity measures is not sufficient to fully resolve pattern recognition dilemmas. Hence, we suggest that researchers who refer to those papers that constructed iterative algorithms with several similarity measures and repeatedly applied those measures to look for a complete solution algorithm.
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.
This study provides a rigorous clarification and abstract unification of the derivative-free cost comparison method originally proposed by Minner for inventory optimization. Traditional discrete cost comparison approaches rely on unverified continuous convexity assumptions and implicit limit convergences. This paper resolves these theoretical gaps through three main contributions. First, a formal discrete inductive proof demonstrates that the first local integer minimum of the total cost sequence strictly guarantees global cost minimization, resolving the candidate selection problem under both unique and tied minimized conditions. Second, the divergence of the optimal partition number and the exact limit convergence of the optimal economic order interval are mathematically verified using the Sandwich Theorem. Third, an abstract single-parameter cost operator is formulated to unify standard economic order quantity (EOQ), EOQ with backorders, and economic production quantity models within a single analytical structure, demonstrating feasibility preservation and eliminating redundant derivations. Furthermore, a systematic taxonomic critique rectifies analytical omissions, expositional ambiguities, and sign-convention errors present across six benchmark papers in the derivative-free inventory literature. This study illustrates the practical efficiency of the unified paradigm.