Conical partition algorithm for maximizing the sum of dc ratios
From MaRDI portal
Recommendations
- Using conical partition to globally maximizing the nonlinear sum of ratios
- A fixed parameter algorithm for optimal convex partitions
- A simplified convergence proof for the cone partitioning algorithm
- Convergent tabu search for optimal partitioning
- Partition-Optimization with Schur Convex Sum Objective Functions
- Approximation Algorithms for the Minimum Convex Partition Problem
- scientific article; zbMATH DE number 3954650
- A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem
- Some constrained partitioning problems and majorization
- Optimal partitions having disjoint convex and conic hulls
Cites work
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A combined algorithm for fractional programming
- A new look at fractional programming
- A parametric method for solving certain nonconcave maximization problems
- Combinatorial Optimization with Rational Objective Functions
- Fractional programming - a survey
- Fractional Programming. I, Duality
- Fractional programming. Theory, methods and applications
- Fractional programming: The sum-of-ratios case
- Generalized linear multiplicative and fractional programming
- Handbook of global optimization
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 3480884 (Why is no real title available?)
- scientific article; zbMATH DE number 1342815 (Why is no real title available?)
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- On Nonlinear Fractional Programming
- On-line and off-line vertex enumeration by adjacency lists
- Parametric approaches to fractional programs
- Programming with linear fractional functionals
- Solving the sum-of-ratios problem by an interior-point method
- Variational analysis
Cited in
(21)- The design centering problem as a d.c. programming problem
- A simplified convergence proof for the cone partitioning algorithm
- Finding the efficiency status and efficient projection in multiobjective linear fractional programming: a linear programming technique
- Global optimization for a class of nonlinear sum of ratios problem
- Global optimization for generalized linear multiplicative programming using convex relaxation
- Using conical partition to globally maximizing the nonlinear sum of ratios
- An iterative approach to solve multiobjective linear fractional programming problems
- Resource allocation: a common set of weights model
- A parametric solution method for a generalized fractional programming problem
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
- A branch-bound cut technique for non-linear fractional multi-objective optimization problems
- Finding a solution for multi-objective linear fractional programming problem based on goal programming and data envelopment analysis
- A practicable branch and bound algorithm for sum of linear ratios problem
- Maximizing for the sum of ratios of two convex functions over a convex set
- A sixth bibliography of fractional programming
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- On covering method for d.c. optimization.
- A combined algorithm for fractional programming
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
- Computing non-dominated solutions in MOLFP
This page was built for publication: Conical partition algorithm for maximizing the sum of dc ratios
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781967)
