A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems
From MaRDI portal
Publication:5928429
DOI10.1023/A:1008314922240zbMath0971.90065OpenAlexW36747366MaRDI QIDQ5928429
Publication date: 28 March 2001
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008314922240
global optimizationbranch-and-bound algorithmcomputational experimentsnonconvex optimizationlinear fractional programminglinear multiplicative programming
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Fractional programming (90C32)
Related Items
Global solutions to fractional programming problem with ratio of nonconvex functions, A practicable branch and bound algorithm for sum of linear ratios problem, A FPTAS for a class of linear multiplicative problems, Solving generalized polynomial problem by using new affine relaxed technique, Outcome space range reduction method for global optimization of sum of affine ratios problem, Global optimization algorithm for sum of generalized polynomial ratios problem, Generating sum-of-ratios test problems in global optimization, A linearized relaxing algorithm for the specific nonlinear optimization problem, Computing non-dominated solutions in MOLFP, A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem, Alternative branching rules for some nonconvex problems, Minimization of isotonic functions composed of Fractions, An efficient algorithm and complexity result for solving the sum of general affine ratios problem, An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming, A potential practical algorithm for minimizing the sum of affine fractional functions, A practicable contraction approach for the sum of the generalized polynomial ratios problem, On duality for a class of quasiconcave multiplicative programs, Global optimization for the sum of generalized polynomial fractional functions, Solving sum of ratios fractional programs via concave minimization, Efficient local search procedures for quadratic fractional programming problems, Global optimization for sum of generalized fractional functions, An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem, A convexity theorem for multiplicative functions, On the global optimization of sums of linear fractional functions over a convex set, Global optimization for sum of linear ratios problem with coefficients, Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs, Global optimization of nonlinear sums of ratios, Global optimization algorithm for the nonlinear sum of ratios problem, Global optimization algorithm for a generalized linear multiplicative programming, An out space accelerating algorithm for generalized affine multiplicative programs problem, An effective algorithm for globally solving sum of linear ratios problems, Maximizing the sum of a generalized Rayleigh quotient and another Rayleigh quotient on the unit sphere via semidefinite programming, Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete problems, A nonisolated optimal solution of general linear multiplicative programming problems, Solving the sum-of-ratios problem by a stochastic search algorithm, Global optimization for a class of fractional programming problems, A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems, A sixth bibliography of fractional programming, Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations, A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
