Decisión multicriterio a través de problemas de optimización cuadrático-fraccionales.
Dual of a linear fractional program through geometric programming
Duality for a fractional variational formulation using -approximated method
The present article explores the way -approximated method is applied to substantiate duality results for the fractional variational problems under invexity. -approximated dual pair is engineered and a careful study of the original dual pair has been done to establish the duality results for original problems. Moreover, an appropriate example is constructed based on which we can validate the established dual statements. The paper includes several recent results as special cases.
Duality for Multiobjective Fractional Programming Problems Involving -Type-I -Set -Functions
Duality in vector optimization. III. Vector partially quasiconcave programming and vector fractional programming
Duality models for some nonclassical problems in the calculus of variations.
Duality theorem for fractional functional programming in complex space
Duality theorems for a class of non-linear programming problems.
Duality of linear programming is used to establish an important duality theorem for a class of non-linear programming problems. Primal problem has quasimonotonic objective function and a convex polyhedron as its constraint set.