Global optimization for the sum of concave-convex ratios problem
Summary: This paper presents a branch and bound algorithm for globally solving the sum of concave-convex ratios problem (P) over a compact convex set. Firstly, the problem (P) is converted to an equivalent problem (P1). Then, the initial nonconvex programming problem is reduced to a sequence of convex programming problems by utilizing linearization technique. The proposed algorithm is convergent to a global optimal solution by means of the subsequent solutions of a series of convex programming problems. Some examples are given to illustrate the feasibility of the proposed algorithm.
- On the global optimization for a class of sum of convex-convex ratios problem
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- Maximizing for the sum of ratios of two convex functions over a convex set
- Global optimization for the problem of sum of convex ratios over nonconvex feasible region
- Global optimization of nonlinear sum of ratios problem
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
- Convex analysis and global optimization
- Decomposition approach for the global minimization of biconcave functions over polytopes
- Fractional programming with absolute-value functions
- Generalized concavity
- Global maximization of a generalized concave multiplicative function
- Global optimization algorithm for the nonlinear sum of ratios problem
- Global optimization for sum of linear ratios problem with coefficients
- Global optimization of nonlinear sum of ratios problem
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- On the global optimization of sums of linear fractional functions over a convex set
- On the posynomial fractional programming problems
- Parametric approaches to fractional programs
- Solving the sum-of-ratios problem by an interior-point method
- Using concave envelopes to globally solve the nonlinear sum of ratios problem
- Global optimization for a class of nonlinear sum of ratios problem
- Using conical partition to globally maximizing the nonlinear sum of ratios
- Solving sum of ratios fractional programs via concave minimization
- Global optimization method for maximizing the sum of difference of convex functions ratios over nonconvex region
- Global optimization for the problem of sum of convex ratios over nonconvex feasible region
- Maximizing for the sum of ratios of two convex functions over a convex set
- On the global optimization for a class of sum of convex-convex ratios problem
- scientific article; zbMATH DE number 6130268 (Why is no real title available?)
- A branch-and-cut algorithm for a class of sum-of-ratios problems
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem
This page was built for publication: Global optimization for the sum of concave-convex ratios problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336807)
