Pages that link to "Item:Q1095810"

The following pages link to Generalized fractional programming duality: A parametric approach (Q1095810):

Displaying 50 items.

• Modified ratio objective approach in mathematical programming (Q813371) (← links)
• Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
• Generalized fractional minimax programming with \(B-(p,r)\)-invexity (Q1004837) (← links)
• Duality without a constraint qualification for minimax fractional programming (Q1293955) (← links)
• On invexity-type nonlinear programming problems (Q1321449) (← links)
• Duality for minmax \(B\)-vex programming involving \(n\)-set functions (Q1378590) (← links)
• A note on fractional minmax programs containing \(n\)-set functions (Q1378606) (← links)
• On incomplete Lagrange function and saddle point optimality criteria in mathematical programming (Q1589940) (← links)
• Dual method of centers for solving generalized fractional programs (Q1679491) (← links)
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
• On minimax fractional optimality and duality with generalized convexity (Q1781966) (← links)
• Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions (Q1816683) (← links)
• Generalized fractional programming: Optimality and duality theory (Q1823160) (← links)
• Three types dual model for minimax fractional programming (Q1972503) (← links)
• An entropic regularized method of centers for continuous minimax problem with semi infinite constraints (Q2143822) (← links)
• Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions (Q2230768) (← links)
• Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806) (← links)
• Saddle-point type optimality criteria and duality relations for generalized fractional programming. (Q2467817) (← links)
• Partial vector invexity and fractional minmax problem (Q2477101) (← links)
• A modified objective function method for solving nonlinear multiobjective fractional programming problems (Q2506437) (← links)
• Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution (Q2691342) (← links)
• On nonsmooth minimax programming problems containing<i>V</i>-ρ-invexity (Q2764980) (← links)
• Duality for minmax programming involving nonsmooth v-invex functions (Q2785400) (← links)
• Parametric approach to multitime multiobjective fractional variational problems under (<i>F</i>,<i>ρ</i>)-convexity (Q2830284) (← links)
• Nonsmooth minimax programming problems with<i>V</i>−<i>r</i>-invex functions (Q3553754) (← links)
• On quality concepts fractional programming (Q3835627) (← links)
• Multiobjective fractional programming duality theory (Q3987783) (← links)
• A Fourth bibliography of fractional programming (Q4327876) (← links)
• On duality concepts in fractional programming (Q4327929) (← links)
• A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions (Q4340162) (← links)
• Generalized fractional programming problems containing locally subdifferentiable and<i>ρ</i>-Univex functions (Q4346893) (← links)
• Optimality and duality for generalized fractional variational problems involving generalized (<i>f</i>ρ)-convex functions (Q4351187) (← links)
• Second order generalized invexity and duality in mathematical programming (Q4372097) (← links)
• On properties of semipreinvex functions (Q4464323) (← links)
• Minmax programming : optimality and Wolfe type duality for a problem involving bectovex functions (Q4465493) (← links)
• Mixed duality without a constraint qualification for minimax fractional programming (Q4467183) (← links)
• Prox-regularization of the dual method of centers for generalized fractional programs (Q4631765) (← links)
• Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions (Q4764579) (← links)
• Duality for minmax programming involving<i>V</i>-invex functions (Q4764859) (← links)
• A Goal Programming Method for Solving Fractional Programming Problems via Dynamic Programming (Q4859827) (← links)
• Non-differentiable pseudo-convex functions and duality for minimax programming problems (Q4859831) (← links)
• Continuous-time generalized fractional programming (Q4893696) (← links)
• Optimality and duality for multiobjective fractional programming involving nonsmooth($si:F$esi:ρ)–convex functions (Q4893719) (← links)
• Mond-Weir type duality involving (B, η)-invex functions for a minmax programming problem (Q4943239) (← links)
• A DC approach for minimax fractional optimization programs with ratios of convex functions (Q5038436) (← links)
• Mixed Lagrange function in minimax fractional programming problems (Q5101835) (← links)
• Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity (Q5157459) (← links)
• Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs (Q5231677) (← links)
• On maximizing the adoption of multi-products in multiple market segments (Q5437801) (← links)
• Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions (Q5689825) (← links)