First and second order fractional programming duality

MaRDI QIDQ2265957zbMATH OpenFDO

Authors V. Jeyakumar

Publication date 1985

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

dualitynonlinear fractional programmingsecond derivatives

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Duality theory (optimization) (49N15) Nonlinear programming (90C30) Fractional programming (90C32)

Review text

Dual problems associated with a primal nonlinear fractional programming problem are formulated that involve second derivatives of the functions in the primal problem. First order dual problems are obtained by reduction from the second order dual problems. A unified approach is presented in obtaining duality results for first and second order dual programs. A possible computational advantage of the second order duals over the first order duals is also mentioned.

Recommendations

• First and Second Order Duality for a class of Nondifferentiable Fractional Programming Problem
• (Generalized) bonvexity and higher order duality for fractional programming
• Second-order duality in nondifferentiable fractional programming
• Second order strict converse duality in nonlinear fractional programming
• Symmetric duality for second-order fractional programs

Cited in

(5)

• On duality for a second-order multiobjective fractional programming problem involving type-I functions
• Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
• First and Second Order Duality for a class of Nondifferentiable Fractional Programming Problem
• Sufficiency criteria and duality for nonlinear programs involving n-set functions
• Higher order duality in multiobjective fractional programming with support functions

This page was built for publication: First and second order fractional programming duality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2265957)