Abstract: | In this article, we study the minimization of a pseudolinear (i.e. pseudoconvex and pseudoconcave) function over a closed convex set subject to linear constraints. Various dual characterizations of the solution set of the minimization problem are given. As a consequence, several characterizations of the solution sets of linear fractional programs as well as linear fractional multi-objective constrained problems are given. Numerical examples are also given. |