This monograph presents smooth, unified, and generalized fractional programming problems, particularly advanced duality models for discrete min-max fractional programming. In the current, interdisciplinary, computer-oriented research environment, these programs are among the most rapidly expanding research areas in terms of their multi-faceted applications including problems ranging from robotics to money market portfolio management. The other more significant aspect of this monograph is in its consideration of minimax fractional integral type problems using higher order sonvexity and sounivexity notions. This is significant for the development of different types of duality models in terms of weak, strong, and strictly converse duality theorems, which can be handled by transforming them into generalized fractional programming problems. Fractional integral type programming is one of the fastest expanding areas of optimization, which feature several types of real-world problems. It can be applied to different branches of engineering (including multi-time multi-objective mechanical engineering problems) as well as to economics, to minimize a ratio of functions between given periods of time. Furthermore, it can be utilized as a resource in order to measure the efficiency or productivity of a system. In these types of problems, the objective function is given as a ratio of functions.

For example, we consider a problem that deals with minimizing a maximum of several time-dependent ratios involving integral expressions.