Global optimization for the generalized polynomial sum of ratios problem
From MaRDI portal
Publication:548182
Recommendations
- Global optimization algorithm for sum of generalized polynomial ratios problem
- A deterministic global optimization algorithm
- Global optimization for the sum of generalized polynomial fractional functions
- Global minimization for generalized polynomial fractional program
- scientific article; zbMATH DE number 5631536
Cites work
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 2190135 (Why is no real title available?)
- A global optimization using linear relaxation for generalized geometric programming
- A robust algorithm for generalized geometric programming
- A robust algorithm for quadratic optimization under quadratic constraints
- A stochastic geometric programming problem with multiplicative recourse
- Allocation of resources in project management
- Computation and application of Taylor polynomials with interval remainder bounds
- Effectiveness of a geometric programming algorithm for optimization of machining economics models
- Fractional Programming. II, On Dinkelbach's Algorithm
- Fractional programming: The sum-of-ratios case
- Generalized geometric programming applied to problems of optimal control. I: Theory
- Global optimization algorithm for the nonlinear sum of ratios problem
- Global optimization for sum of linear ratios problem with coefficients
- Global optimization for the sum of generalized polynomial fractional functions
- Global optimization of fractional programs
- Global optimization of nonlinear sum of ratios problem
- Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form
- Monotonic optimization: Problems and solution approaches
- On the posynomial fractional programming problems
- Optimization of polynomial fractional functions
- Programming with linear fractional functionals
- Recent developments and trends in global optimization
- Robust solution of nonconvex global optimization problems
- Solving sum of quadratic ratios fractional programs via monotonic function
- Solving the sum-of-ratios problem by an interior-point method
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
Cited in
(10)- Range division and compression algorithm for quadratically constrained sum of quadratic ratios
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Optimization of polynomial fractional functions
- A parametric solution method for a generalized fractional programming problem
- Global optimization of polynomials using generalized critical values and sums of squares
- A practicable contraction approach for the sum of the generalized polynomial ratios problem
- On solving the sum-of-ratios problem
- Global minimization for generalized polynomial fractional program
- Time-optimal velocity planning by a bound-tightening technique
- Global optimization algorithm for sum of generalized polynomial ratios problem
This page was built for publication: Global optimization for the generalized polynomial sum of ratios problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548182)