Solving the sum-of-ratios problem by an interior-point method
From MaRDI portal
Publication:1595900
DOI10.1023/A:1008316327038zbMath1168.90644OpenAlexW1495367673MaRDI QIDQ1595900
Roland W. Freund, Florian Jarre
Publication date: 18 February 2001
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008316327038
interior-point methodfractional programmingNP-completenessknapsack problemglobal optimumsum of ratiosconvex subproblem
Related Items
Minimizing the sum of many rational functions, Regional division and reduction algorithm for minimizing the sum of linear fractional functions, On solutions and duality of nonlinear nonsmooth fractional programs, Global solutions to fractional programming problem with ratio of nonconvex functions, A reference point technique to compute nondominated solutions in MOLFP, An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints, Maximizing for the sum of ratios of two convex functions over a convex set, A branch-bound cut technique for non-linear fractional multi-objective optimization problems, A solution approach for cardinality minimization problem based on fractional programming, Computing non-dominated solutions in MOLFP, Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds, Interference game for intelligent sensors in cyber-physical systems, Minimization of isotonic functions composed of Fractions, Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications, Multiobjective nonlinear sum of fractional optimization problems with nonconvex constraints with the use of the duality-based branch and bound algorithm, Joint location and cost planning in maximum capture facility location under random utilities, A linearization to the multi-objective linear plus linear fractional program, A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem, On solving the sum-of-ratios problem, A practical but rigorous approach to sum-of-ratios optimization in geometric applications, An exact method for solving the integer sum of linear ratios problem, A new efficient approach to tackle multi objective linear fractional problem with flexible constraints, Effective algorithm and computational complexity for solving sum of linear ratios problem, A global optimization algorithm for sum of quadratic ratios problem with coefficients, Using conical partition to globally maximizing the nonlinear sum of ratios, Global optimization for a class of nonlinear sum of ratios problem, A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension, Integer quadratic fractional programming problems with bounded variables, A branch-and-cut algorithm for a class of sum-of-ratios problems, Practical global optimization for multiview geometry, Solving sum of ratios fractional programs via concave minimization, Efficient local search procedures for quadratic fractional programming problems, Solving fractional problems with dynamic multistart improving hit-and-run, A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem, An outcome space algorithm for minimizing a class of linear ratio optimization problems, An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients, An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem, Duality-based branch-bound computational algorithm for sum-of-linear-fractional multi-objective optimization problem, Solving the sum-of-ratios problems by a harmony search algorithm, Global optimization of nonlinear sum of ratios problem, Global optimization for the generalized polynomial sum of ratios problem, Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions, An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels, Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications, Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs, Global optimization for sum of geometric fractional functions, Conical partition algorithm for maximizing the sum of dc ratios, Global optimization of nonlinear sums of ratios, Optimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problem, Global optimization algorithm for the nonlinear sum of ratios problem, Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming, Global Optimization for 2D SLAM Problem, Solving the sum-of-ratios problem by a stochastic search algorithm, Solving sum of quadratic ratios fractional programs via monotonic function, A parametric solution method for a generalized fractional programming problem, Global optimization for a class of fractional programming problems, Solution of a fractional combinatorial optimization problem by mixed integer programming, The attractive traveling salesman problem, A sixth bibliography of fractional programming, Global optimization for the sum of concave-convex ratios problem, A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems, An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
