Pages that link to "Item:Q799495"
From MaRDI portal
The following pages link to An algorithm for generalized fractional programs (Q799495):
Displaying 50 items.
- Continuous-time generalized fractional programming problems. Part I: Basic theory (Q353165) (← links)
- Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
- Robust fractional programming (Q493047) (← links)
- Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity (Q555353) (← links)
- On a dynamic fractional game (Q596794) (← links)
- Minimization of isotonic functions composed of Fractions (Q613584) (← links)
- Linear programming system identification (Q706953) (← links)
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions (Q831364) (← links)
- Modified Dinkelbach-Type algorithm for generalized fractional programs with infinitely many ratios (Q852112) (← links)
- Generalized fractional minimax programming with \(B-(p,r)\)-invexity (Q1004837) (← links)
- Revisiting Dinkelbach-type algorithms for generalized fractional programs (Q1021012) (← links)
- An inexact proximal point method for solving generalized fractional programs (Q1024832) (← links)
- Generic algorithm for generalized fractional programming (Q1029285) (← links)
- Generalized fractional programming: Algorithms and numerical experimentation (Q1058468) (← links)
- A note on an algorithm for generalized fractional programs (Q1062921) (← links)
- Saddle-point type optimality criteria for generalized fractional programming (Q1090248) (← links)
- Generalized fractional programming duality: A parametric approach (Q1095810) (← links)
- Convergence of interval-type algorithms for generalized fractional programming (Q1123816) (← links)
- Algorithms for generalized fractional programming (Q1181731) (← links)
- Duality in generalized nonlinear fractional programming (Q1206878) (← links)
- Duality without a constraint qualification for minimax fractional programming (Q1293955) (← links)
- Duality for minmax \(B\)-vex programming involving \(n\)-set functions (Q1378590) (← links)
- Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique (Q1659228) (← links)
- Dual method of centers for solving generalized fractional programs (Q1679491) (← links)
- A fuzzy approach using generalized Dinkelbach's algorithm for multiobjective linear fractional transportation problem (Q1718979) (← links)
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions (Q1816683) (← links)
- Minimax programming under \((p,r)\)-invexity (Q1827643) (← links)
- Enhanced bisection strategies for the maximin efficiency ratio model (Q1869406) (← links)
- An interior-point method for multifractional programs with convex constraints (Q1893345) (← links)
- Generalized fractional programming and cutting plane algorithms (Q1906751) (← links)
- A new algorithm for generalized fractional programs (Q1919091) (← links)
- Using duality to solve generalized fractional programming problems (Q1924069) (← links)
- Three types dual model for minimax fractional programming (Q1972503) (← links)
- An iterative approach to solve multiobjective linear fractional programming problems (Q1991300) (← links)
- Quadratic double-ratio minimax optimization (Q2060599) (← links)
- Optimality and duality results for \(E\)-differentiable multiobjective fractional programming problems under \(E\)-convexity (Q2068082) (← 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)
- A fast approach to deformable surface 3D tracking (Q2276030) (← links)
- Duality for generalized fractional programs involving n-set functions (Q2276888) (← links)
- An effective branch and bound algorithm for minimax linear fractional programming (Q2336179) (← links)
- A new branch and bound algorithm for minimax ratios problems (Q2364779) (← links)
- Prox-dual regularization algorithm for generalized fractional programs (Q2411175) (← links)
- Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806) (← links)
- Minimax programming under generalized \((p, r)\)-invexity (Q2425833) (← 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)
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems (Q2583182) (← links)
