Global optimization of nonlinear sums of ratios
From MaRDI portal
Publication:5955588
DOI10.1006/jmaa.2001.7650zbMath1006.90064OpenAlexW2094129854MaRDI QIDQ5955588
Publication date: 12 March 2003
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jmaa.2001.7650
Related Items
Minimization of isotonic functions composed of Fractions, Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm, A branch-and-cut algorithm for a class of sum-of-ratios problems, Solving sum of ratios fractional programs via concave minimization, Efficient local search procedures for quadratic fractional programming problems, Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem, An outcome space approach for generalized convex multiplicative programs, Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs, Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem, Solving the sum-of-ratios problem by a stochastic search algorithm, A sixth bibliography of fractional programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Generalized concavity
- Global minimization of a generalized convex multiplicative function
- Image space analysis of generalized fractional programs
- Multiplicative programming problems: Analysis and efficient point search heuristic
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- Minimization of the sum of three linear fractional functions
- Solving the sum-of-ratios problem by an interior-point method
- A global optimization algorithm for linear fractional and bilinear programs
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Fractional Programming — Some Recent Developments
- On Maximizing a Sum of Ratios
- A note on the sum of a linear and linear-fractional function
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
