scientific article; zbMATH DE number 1342815
From MaRDI portal
Publication:4266762
DOI<583::AID-NAV8>3.0.CO;2-5 10.1002/(SICI)1520-6750(199908)46:5<583::AID-NAV8>3.0.CO;2-5zbMath0948.90132MaRDI QIDQ4266762
Hiroshi Konno, Hajime Yamashita
Publication date: 22 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
global optimizationpolytopenonconvex minimizationouter approximation algorithmlinear fractional functionsCharnes-Cooper transformation
Related Items
Regional division and reduction algorithm for minimizing the sum of linear fractional functions, A global optimization algorithm for linear fractional programming, Generating sum-of-ratios test problems in global optimization, Computing non-dominated solutions in MOLFP, A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem, 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 potential practical algorithm for minimizing the sum of affine fractional functions, 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, A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension, Integer quadratic fractional programming problems with bounded variables, A branch-and-cut algorithm for a class of sum-of-ratios problems, A sequential method for a class of pseudoconcave fractional problems, Solving sum of ratios fractional programs via concave minimization, A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem, An outcome space algorithm for minimizing a class of linear ratio optimization problems, An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem, A deterministic method for solving the sum of linear ratios problem, An outcome space approach for generalized convex multiplicative programs, 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, Conical partition algorithm for maximizing the sum of dc ratios, Global optimization of nonlinear sums of ratios, Global optimization algorithm for the nonlinear sum of ratios problem, Minimizing the sum of a linear and a linear fractional function applying conic quadratic representation: continuous and discrete 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, An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
Cites Work
- An outer approximation method for minimizing the product of several convex functions on a convex set
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- On-line and off-line vertex enumeration by adjacency lists
- Linear multiplicative programming
- Global minimization of a generalized convex multiplicative function
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- A note on the sum of a linear and linear-fractional function
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Programming with linear fractional functionals
