Continuous‐Time Generalized Fractional Programming Problems, Part II: An Interval‐Type Computational Procedure

The theory presented in Part I (Wen, 2012) of this study led to a theoretical parametric procedure for continuous‐time generalized fractional programming problems. In this paper (Part II), an interval‐type computational procedure by combining the parametric method and discretization approach is proposed. The proposed method is promising particularly when it is acceptable to find an effective, but near‐optimal value in an efficient manner. Once the error tolerance is predetermined, we can determine the size of discretization in advance such that the accuracy of the corresponding approximate solution can be controlled within the predefined error tolerance. Hence, the trade‐off between the quality of the results and the simplification of the problem can be controlled by the decision maker. Finally, we provide some numerical examples to implement our proposed method.