Global minimization for generalized polynomial fractional program
From MaRDI portal
Recommendations
- Global optimization for the sum of generalized polynomial fractional functions
- Global optimization for the generalized polynomial sum of ratios problem
- Global optimization for sum of generalized fractional functions
- Global optimization algorithm for sum of generalized polynomial ratios problem
- A fully polynomial time approximation algorithm for generalized fractional programs
Cites work
- scientific article; zbMATH DE number 1054671 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A global optimization using linear relaxation for generalized geometric programming
- A robust algorithm for generalized geometric programming
- A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- An efficient algorithm for solving convex-convex quadratic fractional programs
- BOND PORTFOLIO OPTIMIZATION PROBLEMS AND THEIR APPLICATIONS TO INDEX TRACKING : A PARTIAL OPTIMIZATION APPROACH
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
- Effectiveness of a geometric programming algorithm for optimization of machining economics models
- Finite algorithm for generalized linear multiplicative programming
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Global optimization for a class of fractional programming problems
- Global optimization for the sum of generalized polynomial fractional functions
- Global optimization of generalized geometric programming
- Global optimization of generalized linear fractional programming with nonlinear constraints
- Global optimization of multiplicative programs
- Global optimization of nonlinear sum of ratios problem
- Global optimization of signomial geometric programming using linear relaxation.
- Monotonic Optimization: Branch and Cut Methods
- Solving long-term financial planning problems via global optimization
- Solving sum of quadratic ratios fractional programs via monotonic function
- \(NP\)-hardness of linear multiplicative programming and related problems
Cited in
(9)- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- Iterative algorithm of generalized fractional programming problems with polynomial constraints
- Global optimization for the sum of generalized polynomial fractional functions
- A branch and bound algorithm for solving the sum of generalized polynomial fractional programming problem
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- Global optimization for the generalized polynomial sum of ratios problem
- Fractional programming approach to a cost minimization problem in electricity market
- Global optimization for sum of generalized fractional functions
This page was built for publication: Global minimization for generalized polynomial fractional program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1718667)
