A eighth bibliography of fractional programming
From MaRDI portal
Cited in
(32)- Green supply chain design with emission sensitive demand: second order cone programming formulation and case study
- Optimality and duality results for \(E\)-differentiable multiobjective fractional programming problems under \(E\)-convexity
- Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
- Necessary and sufficient conditions for achieving global optimal solutions in multiobjective quadratic fractional optimization problems
- Augmented Lagrangian dual for nonconvex minimax fractional programs and proximal bundle algorithms for its resolution
- Effective algorithm and computational complexity for solving sum of linear ratios problem
- Second order symmetric duality in fractional variational problems over cone constraints
- Quadratic optimization over a discrete Pareto set of a multi-objective linear fractional program
- A DC approach for minimax fractional optimization programs with ratios of convex functions
- Solving generalized polynomial problem by using new affine relaxed technique
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- On maximum ratio clique relaxations
- A potential practical algorithm for minimizing the sum of affine fractional functions
- An exact method for solving the integer sum of linear ratios problem
- Solving convex uncertain PDE-constrained multi-dimensional fractional control problems via a new approach
- Successive upper approximation methods for generalized fractional programs
- On the optimality and duality in nonsmooth multiobjective fractional optimization problems via higher-order E-convexity
- Reduced outer space algorithm for globally computing affine sum-of-ratios problems
- Outcome-space based B{\&}B algorithm for min-max affine fractional programs through a series of linear relaxation techniques to solve large-size problems
- Optimizing the minimax affine fractional problem in reduced space
- Proximal bundle methods for generalized fractional programs with ratios of difference of convex functions
- A branch and cut algorithm to optimize a weighted sum-of-ratios in multiobjective mixed-integer fractional programming
- Image space branch-reduction-bound algorithm for globally solving the sum of affine ratios problem
- Parametric optimality and duality results for nondifferentiable L-univex multiobjective fractional programming problems
- Optimality conditions and Lagrange duality for nonsmooth fractional semi-infinite programming with vanishing constraints
- Optimality and duality results for fractional programming problems under E-univexity
- A new global optimization method based on separable relaxation for solving sum of linear ratios problem
- On efficient solutions of nonsmooth fractional multiobjective optimization problems with mixed constraints
- Enhanced interval quadratic fractional programming for maximizing Sharpe ratio in portfolio optimization
- Efficiency and duality for \(E - [0, 1]\) convex multi-objective fractional programming
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
This page was built for publication: A eighth bibliography of fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970405)
