Image space analysis of generalized fractional programs
From MaRDI portal
A nonconvex fractional program whose objective \(f(x)= \sum f_ i(x)\), where \(f_ i(x)= n_ i(x)/d_ i(x)\), is the quotient of affine functions, is analyzed in the image space of vectors \((f_ 1(x),f_ 2(x),\dots)\). An iterative procedure is proposed, applying successive cuts to a region of the image space. This approach is extended to products of ratios, or of linear functions.
Recommendations
- Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem
- Constrained extremum problems and image space analysis. III: Generalized systems
- On the image space analysis for vector variational inequalities
- Semidefinite programming via image space analysis
- Image space analysis and scalarization of multivalued optimization
- Image space analysis for set optimization problems with applications
- Image space analysis and scalarization for -optimization of multifunctions
- Image space analysis for vector optimization problems with constraints
- scientific article; zbMATH DE number 4193477
Cites work
- A Class of Fractional Programming Problems
- A note on the sum of a linear and linear-fractional function
- A parametric method for solving certain nonconcave maximization problems
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Bounds on a Trauma Outcome Function via Optimization
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- Linear multiplicative programming
- On Maximizing a Sum of Ratios
- On Nonlinear Fractional Programming
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Programming with linear fractional functionals
Cited in
(62)- Lagrange duality and partitioning techniques in nonconvex global optimization
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- A reduced space branch and bound algorithm for a class of sum of ratios problems
- Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique
- Fractional 0-1 programming: applications and algorithms
- Constrained integer fractional programming problem with box constraints
- Range division and linearization algorithm for a class of linear ratios optimization problems
- An effective algorithm for globally solving sum of linear ratios problems
- Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
- An iterative approach to solve multiobjective linear fractional programming problems
- A deterministic method for solving the sum of linear ratios problem
- Resource allocation: a common set of weights model
- 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
- An outcome space algorithm for minimizing a class of linear ratio optimization problems
- An objective space cut and bound algorithm for convex multiplicative programmes
- Global optimization method for linear multiplicative programming
- A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
- A global optimization algorithm for linear fractional programming
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Solving sum of ratios fractional programs via concave minimization
- Global optimization for sum of linear ratios problem with coefficients
- A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems
- An efficient algorithm and complexity result for solving the sum of general affine ratios problem
- Effective algorithm and computational complexity for solving sum of linear ratios problem
- Solving sum-of-ratios fractional programs using efficient points
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- A practicable branch and bound algorithm for sum of linear ratios problem
- Outcome space range reduction method for global optimization of sum of affine ratios problem
- A revised algorithm for solving the sum of linear ratios problem with lower dimension using linear relaxation
- A fifth bibliography of fractional programming*
- scientific article; zbMATH DE number 1419368 (Why is no real title available?)
- scientific article; zbMATH DE number 1423917 (Why is no real title available?)
- Global optimization of linear multiplicative programming using univariate search
- 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
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- 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
- A new linearization method for generalized linear multiplicative programming
- A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
- A method based on parametric convex programming for solving convex multiplicative programming problem
- A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- Spatial algorithm for mixed integer generalized affine multiplicative problems
- Convexification techniques for fractional programs
- A branch-reduction-bound algorithm for linear fractional multi-product planning problems
- Maximizing a linear fractional function on a Pareto efficient frontier
- Image space branch-reduction-bound algorithm for globally solving the sum of affine ratios problem
- On the global optimization of sums of linear fractional functions over a convex set
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- Global branch-reduction-bound algorithm to tackle the sum of the general affine ratios programming
- A new global optimization method based on separable relaxation for solving sum of linear ratios problem
- A FPTAS for a class of linear multiplicative problems
- An outcome-space finite algorithm for solving linear multiplicative programming
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- An efficient algorithm for globally solving generalized linear multiplicative programming
- An outcome space approach for generalized convex multiplicative programs
This page was built for publication: Image space analysis of generalized fractional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315441)
