Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
From MaRDI portal
Publication:1804585
DOI10.1007/BF01096767zbMATH Open0835.90073MaRDI QIDQ1804585FDOQ1804585
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)
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
- Programming with linear fractional functionals
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Image space analysis of generalized fractional programs
- Title not available (Why is that?)
- An efficient solution method for rank two quasiconcave minimization problems
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- Minimizing the sum of a convex function and the product of two affine functions over a convex set
- Method for minimizing a convex-concave function over a convex set
- Mathematical programs with a two-dimensional reverse convex constraint
- A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
Cited In (7)
- Regional division and reduction algorithm for minimizing the sum of linear fractional functions
- An algorithm for optimizing over the efficient set of a multiple objective affine fractional problem.
- A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem
- A potential practical algorithm for minimizing the sum of affine fractional functions
- A fifth bibliography of fractional programming*
- 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)
