Minimization of the sum of three linear fractional functions

DOI10.1023/A:1008376731013zbMath0961.90115OpenAlexW1513716913MaRDI QIDQ1567073

Natsuroh Abe, Hiroshi Konno

Publication date: 5 June 2000

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

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

zbMATH Keywords

global optimizationheuristic algorithmbranch-and-bound methodlinear fractional functionparametric simplex algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Fractional programming (90C32)

Related Items (36)

Generating the efficient set of multiobjective integer linear plus linear fractional programming problems ⋮ A practicable branch and bound algorithm for sum of linear ratios problem ⋮ A reduced space branch and bound algorithm for a class of sum of ratios problems ⋮ Global optimization algorithm for sum of generalized polynomial ratios problem ⋮ A deterministic global optimization algorithm ⋮ Generating sum-of-ratios test problems in global optimization ⋮ A global optimization algorithm for sum of linear ratios problem ⋮ Computing non-dominated solutions in MOLFP ⋮ An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem ⋮ Constrained integer fractional programming problem with box constraints ⋮ A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem ⋮ A new deterministic global computing algorithm for solving a kind of linear fractional programming ⋮ A global optimization algorithm for sum of quadratic ratios problem with coefficients ⋮ Unnamed Item ⋮ An effective computational algorithm for the global solution of a class of linear fractional programming ⋮ A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension ⋮ Integer quadratic fractional programming problems with bounded variables ⋮ Global optimization for the sum of generalized polynomial fractional functions ⋮ Solving fractional problems with dynamic multistart improving hit-and-run ⋮ Range division and compression algorithm for quadratically constrained sum of quadratic ratios ⋮ Global optimization for sum of generalized fractional functions ⋮ An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem ⋮ Solving the sum-of-ratios problems by a harmony search algorithm ⋮ A deterministic method for solving the sum of linear ratios problem ⋮ Global optimization of nonlinear sum of ratios problem ⋮ On the global optimization of sums of linear fractional functions over a convex set ⋮ Global optimization for sum of linear ratios problem with coefficients ⋮ Global optimization for sum of geometric fractional functions ⋮ Global optimization of nonlinear sums of ratios ⋮ Global optimization algorithm for the nonlinear sum of ratios problem ⋮ Solving the sum-of-ratios problem by a stochastic search algorithm ⋮ A branch and bound algorithm to globally solve the sum of several linear ratios ⋮ 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 ⋮ An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems

This page was built for publication: Minimization of the sum of three linear fractional functions