A branch-and-bound algorithm for maximizing the sum of several linear ratios

From MaRDI portal
Revision as of 07:49, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:598594

DOI10.1023/A:1013807129844zbMath1045.90071OpenAlexW1556949287MaRDI QIDQ598594

Takahito Kuno

Publication date: 12 August 2004

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1013807129844




Related Items (68)

Minimizing the sum of many rational functionsGenerating the efficient set of multiobjective integer linear plus linear fractional programming problemsGlobal solutions to fractional programming problem with ratio of nonconvex functionsA reference point technique to compute nondominated solutions in MOLFPNon polyhedral convex envelopes for 1-convex functionsA practicable branch and bound algorithm for sum of linear ratios problemAn efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraintsMaximizing for the sum of ratios of two convex functions over a convex setFinding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming techniqueGlobal optimization of generalized linear fractional programming with nonlinear constraintsA deterministic global optimization algorithmGenerating sum-of-ratios test problems in global optimizationComputing non-dominated solutions in MOLFPA simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problemAlternative branching rules for some nonconvex problemsMinimization of isotonic functions composed of FractionsConvex Envelopes of Some Quadratic Functions over the n-Dimensional Unit SimplexAn efficient algorithm and complexity result for solving the sum of general affine ratios problemA new deterministic global computing algorithm for solving a kind of linear fractional programmingA practical but rigorous approach to sum-of-ratios optimization in geometric applicationsAn exact method for solving the integer sum of linear ratios problemEffective algorithm and computational complexity for solving sum of linear ratios problemA global optimization algorithm for sum of quadratic ratios problem with coefficientsUsing conical partition to globally maximizing the nonlinear sum of ratiosUnnamed ItemGlobal optimization for a class of nonlinear sum of ratios problemGlobal minimization for generalized polynomial fractional programA linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimensionA branch-and-cut algorithm for a class of sum-of-ratios problemsSolving sum of ratios fractional programs via concave minimizationEfficient local search procedures for quadratic fractional programming problemsSolving fractional problems with dynamic multistart improving hit-and-runA simplicial branch and duality bound algorithm for the sum of convex-convex ratios problemAn iterative approach to solve multiobjective linear fractional programming problemsAn outcome space algorithm for minimizing a class of linear ratio optimization problemsA technique to derive the analytical form of convex envelopes for some bivariate functionsPolyhedral subdivisions and functional forms for the convex envelopes of bilinear, fractional and other bivariate functions over general polytopesConvex envelopes of bivariate functions through the solution of KKT systemsGlobal optimization for sum of generalized fractional functionsAn extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problemSolving the sum-of-ratios problems by a harmony search algorithmGlobal optimization of nonlinear sum of ratios problemAcceleration procedure for special classes of multi-extremal problemsOn the global optimization of sums of linear fractional functions over a convex setAn approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channelsGlobal optimization for sum of linear ratios problem with coefficientsBranch-and-bound outer approximation algorithm for sum-of-ratios fractional programsGlobal optimization for sum of geometric fractional functionsConical partition algorithm for maximizing the sum of dc ratiosGlobal optimization of nonlinear sums of ratiosOptimization of chance constraint programming with sum-of-fractional objectives â an application to assembled printed circuit board problemGlobal optimization algorithm for the nonlinear sum of ratios problemMaximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programmingMinimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problemsA doubly nonnegative relaxation for modularity density maximizationGlobal optimization for sum of linear ratios problem using new pruning techniqueResource allocation: a common set of weights modelSolving the sum-of-ratios problem by a stochastic search algorithmSolving sum of quadratic ratios fractional programs via monotonic functionA parametric solution method for a generalized fractional programming problemA Branch & Cut Algorithm to Compute Nondominated Solutions in MOLFP via Reference PointsGlobal optimization for a class of fractional programming problemsConvex envelopes for ray-concave functionsA branch and bound algorithm to globally solve the sum of several linear ratiosA sixth bibliography of fractional programmingGlobal optimization for the sum of concave-convex ratios problemSolution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone ApproximationsA revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems







This page was built for publication: A branch-and-bound algorithm for maximizing the sum of several linear ratios