A parametric solution method for a generalized fractional programming problem
From MaRDI portal
Publication:2065366
Recommendations
- Method of centers for generalized fractional programming
- Fractional Programming
- Solving special nonlinear fractional programming problems via parametric linear programming
- Global optimization for sum of generalized fractional functions
- Global optimization for the generalized polynomial sum of ratios problem
Cites work
- scientific article; zbMATH DE number 3716008 (Why is no real title available?)
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- A branch and bound algorithm to globally solve the sum of several linear ratios
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- Conical partition algorithm for maximizing the sum of dc ratios
- Fractional programming: The sum-of-ratios case
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Global optimization algorithm for the nonlinear sum of ratios problem
- Global optimization for sum of geometric fractional functions
- Global optimization for sum of linear ratios problem with coefficients
- Global optimization for the generalized polynomial sum of ratios problem
- Global optimization for the sum of generalized polynomial fractional functions
- Mesh shape-quality optimization using the inverse mean-ratio metric
- Nonlinear Programming
- Practical global optimization for multiview geometry
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Sensitivity analysis for nonlinear programming using penalty methods
- Solving sum of ratios fractional programs via concave minimization
- Solving the sum-of-ratios problem by a stochastic search algorithm
- Solving the sum-of-ratios problem by an interior-point method
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- Using conical partition to globally maximizing the nonlinear sum of ratios
Cited in
(9)- Fractional programming-based heuristic: an efficient method for marine inventory routing problem
- Method of centers for generalized fractional programming
- An equivalent fractional optimization problem under invexity conditions for solving fractional vector variational-like inequality problems to portfolio optimization in finance
- scientific article; zbMATH DE number 5257973 (Why is no real title available?)
- A solution approach for cardinality minimization problem based on fractional programming
- A generalization of Ritz-variational method for solving a class of fractional optimization problems
- Enhanced index tracking problem: a new optimization model and a sum-of-ratio based algorithm
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems
- scientific article; zbMATH DE number 3900540 (Why is no real title available?)
This page was built for publication: A parametric solution method for a generalized fractional programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065366)
