Solving a class of generalized fractional programming problems using the feasibility of linear programs
From MaRDI portal
Publication:2360402
DOI10.1186/s13660-017-1420-1zbMath1365.90243OpenAlexW2719822262WikidataQ33844779 ScholiaQ33844779MaRDI QIDQ2360402
Tongli Zhang, Chun-Feng Wang, Pei-Ping Shen
Publication date: 3 July 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-017-1420-1
computational complexityglobal optimizationapproximation algorithmgeneralized fractional programming
Nonlinear programming (90C30) Stochastic programming (90C15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A parametric linearizing approach for quadratically inequality constrained quadratic programs, Global optimization algorithm for solving linear multiplicative programming problems, Global algorithm for solving linear multiplicative programming problems, A linearization to the multi-objective linear plus linear fractional program, An Output-Space Based Branch-and-Bound Algorithm for Sum-of-Linear-Ratios Problem, A spatial branch and bound algorithm for solving the sum of linear ratios optimization problem, An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming, A new efficient approach to tackle multi objective linear fractional problem with flexible constraints, 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, An effective computational algorithm for the global solution of a class of linear fractional programming, Unnamed Item, An effective global optimization algorithm for quadratic programs with quadratic constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Range division and contraction algorithm for a class of global optimization problems
- An FPTAS for optimizing a class of low-rank functions over a polytope
- Linear decomposition approach for a class of nonconvex programming problems
- Approximation of linear fractional-multiplicative problems
- An FPTAS for minimizing the product of two non-negative linear cost functions
- A FPTAS for a class of linear multiplicative problems
- An outcome-space finite algorithm for solving linear multiplicative programming
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Cutting plane/tabu search algorithms for low rank concave quadratic programming problems
- A unified monotonic approach to generalized linear fractional programming
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- Polynomial algorithms for a class of minimum rank-two cost path problems
- Heuristic methods for linear multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- Approximation algorithm for a class of global optimization problems
- A practical but rigorous approach to sum-of-ratios optimization in geometric applications
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems
- An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
- An objective space cut and bound algorithm for convex multiplicative programmes
- A global optimization algorithm for linear fractional programming
- Global optimization for sum of generalized fractional functions
- \(NP\)-hardness of linear multiplicative programming and related problems
- Fractional programming: The sum-of-ratios case
- Robust Optimization of Large-Scale Systems
- Fractional programming
