Pages that link to "Item:Q3750534"

The following pages link to An Algorithm for a Class of Nonconvex Programming Problems with Nonlinear Fractional Objectives (Q3750534):

Displaying 11 items.

• Convergence of interval-type algorithms for generalized fractional programming (Q1123816) (← links)
• Algorithms for generalized fractional programming (Q1181731) (← links)
• An interior-point method for multifractional programs with convex constraints (Q1893345) (← links)
• Duality for generalized fractional programs involving n-set functions (Q2276888) (← links)
• Optimality conditions and duality for a class of continuous-time generalized fractional programming problems (Q2639330) (← links)
• Optimality conditions and duality for constrained measurable subset selection problems with minmax objective functions (Q3833882) (← links)
• A Fourth bibliography of fractional programming (Q4327876) (← links)
• Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions (Q4764579) (← links)
• Continuous-time generalized fractional programming (Q4893696) (← links)
• A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints (Q5057970) (← links)
• Efficient algorithms for solving nonlinear fractional programming problems (Q5080834) (← links)