A parametric solution method for a generalized fractional programming problem
DOI10.1007/S13226-021-00102-YzbMATH Open1477.90111OpenAlexW3167274107MaRDI QIDQ2065366FDOQ2065366
J. W. Yu, Yong-Jin Kim, YunChol Jong
Publication date: 7 January 2022
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13226-021-00102-y
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
Numerical mathematical programming methods (65K05) Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Title not available (Why is that?)
- Solving the sum-of-ratios problem by a stochastic search algorithm
- Solving the sum-of-ratios problem by an interior-point method
- Fractional programming: The sum-of-ratios case
- Nonlinear Programming
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Global optimization algorithm for the nonlinear sum of ratios problem
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- Practical global optimization for multiview geometry
- Global optimization for sum of geometric fractional functions
- Sensitivity analysis for nonlinear programming using penalty methods
- Solving sum of ratios fractional programs via concave minimization
- Conical partition algorithm for maximizing the sum of dc ratios
- Using conical partition to globally maximizing the nonlinear sum of ratios
- Global optimization for sum of linear ratios problem with coefficients
- 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
- Global optimization algorithm for sum of generalized polynomial ratios problem
- Branch-and-bound outer approximation algorithm for sum-of-ratios fractional programs
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- Global optimization for the sum of generalized polynomial fractional functions
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- Global optimization for the generalized polynomial sum of ratios problem
- A global optimization algorithm for sum of quadratic ratios problem with coefficients
- Mesh shape-quality optimization using the inverse mean-ratio metric
Cited In (7)
- Method of centers for generalized fractional programming
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
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)
