A unified monotonic approach to generalized linear fractional programming

DOI10.1023/A:1023274721632zbMath1039.90079OpenAlexW1507300232MaRDI QIDQ1422886

Nguyen Thi Hoai Phuong, Hoang Tuy

Publication date: 12 February 2004

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

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

zbMATH Keywords

Global optimizationMonotonic optimizationGeneralized fractional programmingPolyblock approximation approachSum or product of ratios of linear functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Fractional programming (90C32) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Solving a class of generalized fractional programming problems using the feasibility of linear programs, A new branch and bound algorithm for minimax ratios problems, Global solutions to fractional programming problem with ratio of nonconvex functions, A practicable branch and bound algorithm for sum of linear ratios problem, Solving generalized polynomial problem by using new affine relaxed technique, A reduced space branch and bound algorithm for a class of sum of ratios problems, Outcome space range reduction method for global optimization of sum of affine ratios problem, Global optimization algorithm for sum of generalized polynomial ratios problem, Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique, Global optimization of generalized linear fractional programming with nonlinear constraints, A linearized relaxing algorithm for the specific nonlinear optimization problem, A new linearization technique for minimax linear fractional programming, Computing non-dominated solutions in MOLFP, A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem, Two-level linear relaxation method for generalized linear fractional programming, An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem, An efficient algorithm and complexity result for solving the sum of general affine ratios problem, A new linearization method for generalized linear multiplicative programming, 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, Interval division and linearization algorithm for minimax linear fractional program, Effective algorithm and computational complexity for solving sum of linear ratios problem, Range division and linearization algorithm for a class of linear ratios optimization problems, An effective computational algorithm for the global solution of a class of linear fractional programming, A new accelerating method for globally solving a class of nonconvex programming problems, Unnamed Item, The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems, Global optimization for the sum of generalized polynomial fractional functions, Solving fractional problems with dynamic multistart improving hit-and-run, An iterative approach to solve multiobjective linear fractional programming problems, 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, Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs, Global optimization algorithm for a generalized linear multiplicative programming, Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints, An out space accelerating algorithm for generalized affine multiplicative programs problem, An effective algorithm for globally solving sum of linear ratios problems, Half-open polyblock for the representation of the search region in multiobjective optimization problems: its application and computational aspects, A branch and bound algorithm for globally solving a class of nonconvex programming problems, Global optimization for sum of linear ratios problem using new pruning technique, Inner approximation algorithm for generalized linear multiplicative programming problems, Solving the sum-of-ratios problem by a stochastic search algorithm, Global optimization for a class of fractional programming problems, An effective branch and bound algorithm for minimax linear fractional programming, 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, The maximax minimax quotient theorem