Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions

DOI10.1007/BF01096767MaRDI QIDQ1804585zbMATH OpenFDO

Authors Le Dung Muu, Bui The Tam, S. Schaible

Publication date 15 April 1996

Published in Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

global minimumbranch-and- boundproduct of two affine fractional functions

Mathematics Subject Classification ID

Fractional programming (90C32) Nonconvex programming, global optimization (90C26)

Recommendations

• An efficient algorithm for solving convex-convex quadratic fractional programs
• Minimizing the sum of a convex function and the product of two affine functions over a convex set
• An algorithm for optimizing over the efficient set of a multiple objective affine fractional problem.
• Optimizing of sums and products of linear fractional functions under linear constraints
• scientific article; zbMATH DE number 1342815

Cites work

• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
• An efficient solution method for rank two quasiconcave minimization problems
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• Image space analysis of generalized fractional programs
• Mathematical programs with a two-dimensional reverse convex constraint
• Method for minimizing a convex-concave function over a convex set
• Minimizing the sum of a convex function and the product of two affine functions over a convex set
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
• Programming with linear fractional functionals

Cited in

(7)

• A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
• A potential practical algorithm for minimizing the sum of affine fractional functions
• An algorithm for optimizing over the efficient set of a multiple objective affine fractional problem.
• A fifth bibliography of fractional programming^*
• Regional division and reduction algorithm for minimizing the sum of linear fractional functions
• An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
• A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems

This page was built for publication: Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1804585)