An approximate approach for fractional programming with absolute-value functions
From MaRDI portal
Publication:1763230
DOI10.1016/j.amc.2003.12.017zbMath1063.65043OpenAlexW1990565718MaRDI QIDQ1763230
Publication date: 22 February 2005
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2003.12.017
integer programmingquadratic programminglinearizationgoal programmingfractional programmingbranch and bound methodabsolute-value functions
Numerical mathematical programming methods (65K05) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Quadratic programming (90C20) Fractional programming (90C32)
Related Items
A fractional programming algorithm based on conic quasi-Newton trust region method for unconstrained minimization ⋮ On optimality and duality theorems of nonlinear disjunctive fractional minmax programs ⋮ A global optimization algorithm for sum of quadratic ratios problem with coefficients ⋮ On fractional programming problems with absolute-value functions ⋮ A study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming ⋮ Formulating the mixed integer fractional posynomial programming ⋮ On the optimality of nonlinear fractional disjunctive programming problems
Uses Software
Cites Work
- Fractional programming - a survey
- A note on a global approach for general 0-1 fractional programming
- A global approach for general \(0-1\) fractional programming
- A modified goal programming model for piecewise linear functions
- Fractional programming with absolute-value functions
- On the posynomial fractional programming problems
- A fifth bibliography of fractional programming*
- Hyperbolic programming
- Letter to the Editor—Linear Fractional Functionals Programming
- Technical Note—“Linear” Programming with Absolute-Value Functionals
- On the polynomial mixed 0-1 fractional programming problems
