Minimization of the sum of three linear fractional functions

DOI10.1023/A:1008376731013MaRDI QIDQ1567073zbMATH OpenOpenAlexFDO

Authors Hiroshi Konno, Natsuroh Abe

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

branch-and-bound methodglobal optimizationheuristic algorithmlinear fractional functionparametric simplex algorithm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1342815
• scientific article; zbMATH DE number 1664572
• Regional division and reduction algorithm for minimizing the sum of linear fractional functions
• Optimizing of sums and products of linear fractional functions under linear constraints
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems

Cited in

(50)

• Solving the sum-of-ratios problem by a stochastic search algorithm
• Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• A reduced space branch and bound algorithm for a class of sum of ratios problems
• Constrained integer fractional programming problem with box constraints
• Integer quadratic fractional programming problems with bounded variables
• Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
• A deterministic method for solving the sum of linear ratios problem
• An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
• 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
• Global optimization for the sum of generalized polynomial fractional functions
• Solving fractional problems with dynamic multistart improving hit-and-run
• Global optimization for sum of generalized fractional functions
• Global optimization for sum of linear ratios problem with coefficients
• A branch and bound algorithm to globally solve the sum of several linear ratios
• A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
• scientific article; zbMATH DE number 1664572 (Why is no real title available?)
• Optimizing of sums and products of linear fractional functions under linear constraints
• A practicable branch and bound algorithm for sum of linear ratios problem
• A revised algorithm for solving the sum of linear ratios problem with lower dimension using linear relaxation
• A sixth bibliography of fractional programming
• Global optimization algorithm for sum of generalized polynomial ratios problem
• A global optimization algorithm for sum of linear ratios problem
• Massimo della somma tra una funzione lineare ed una funzione lineare fratta
• scientific article; zbMATH DE number 1342815 (Why is no real title available?)
• A global optimization algorithm for sum of quadratic ratios problem with coefficients
• Range division and compression algorithm for quadratically constrained sum of quadratic ratios
• Solution approaches to linear fractional programming and its stochastic generalizations using second order cone approximations
• Global optimization of nonlinear sums of ratios
• Global optimization algorithm for the nonlinear sum of ratios problem
• Generating sum-of-ratios test problems in global optimization
• An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem
• 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 potential practical algorithm for minimizing the sum of affine fractional functions
• Branch-relaxation-bound algorithm for minimizing a class of sum of affine ratios programming problems
• An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
• An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule
• An adaptive branch-and-bound reduction algorithm for minimizing sum of linear ratios programs
• Global optimization of nonlinear sum of ratios problem
• Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme
• On the global optimization of sums of linear fractional functions over a convex set
• Global branch-reduction-bound algorithm to tackle the sum of the general affine ratios programming
• Regional division and reduction algorithm for minimizing the sum of linear fractional functions
• Generating the efficient set of multiobjective integer linear plus linear fractional programming problems
• A deterministic global optimization algorithm
• Computing non-dominated solutions in MOLFP
• Solving the sum-of-ratios problems by a harmony search algorithm
• Global optimization for sum of geometric fractional functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1567073)