An approximate approach for fractional programming with absolute-value functions

DOI10.1016/J.AMC.2003.12.017MaRDI QIDQ1763230zbMATH OpenOpenAlexFDO

Authors Ching-Ter Chang

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

zbMATH Keywords

absolute-value functionsbranch and bound methodfractional programminggoal programminginteger programminglinearizationquadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Quadratic programming (90C20) Multi-objective and goal programming (90C29) Fractional programming (90C32) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Review text

Consider the fractional programming problem with absolute-value functions. The author proposes an approximate approach by converting the problem into an equivalent non-linear quadratic mixed integer programming problem with absolute value. Then the model is linearized using piecewise logarithmic program. The program is finally solved using the branch and bound method.

Recommendations

• Fractional programming with absolute-value functions
• scientific article; zbMATH DE number 3508267
• On fractional programming problems with absolute-value functions
• Fractional programming with absolute-value functions: a fuzzy goal programming approach
• Minimization of the ratio of functions defined as sums of the absolute values

Cites work

• A fifth bibliography of fractional programming^*
• A global approach for general 0-1 fractional programming
• A modified goal programming model for piecewise linear functions
• A note on a global approach for general 0-1 fractional programming
• Fractional programming - a survey
• Fractional programming with absolute-value functions
• Hyperbolic programming
• Letter to the Editor—Linear Fractional Functionals Programming
• On the polynomial mixed 0-1 fractional programming problems
• On the posynomial fractional programming problems
• Technical Note—“Linear” Programming with Absolute-Value Functionals

Cited in

(11)

• Fractional programming with absolute-value functions
• Minimization of the ratio of functions defined as sums of the absolute values
• Formulating the mixed integer fractional posynomial programming
• On the optimality of nonlinear fractional disjunctive programming problems
• Fractional programming with absolute-value functions: a fuzzy goal programming approach
• On fractional programming problems with absolute-value functions
• Solving non-linear fractional programming problem with a special structure using approximation
• A global optimization algorithm for sum of quadratic ratios problem with coefficients
• 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 study on optimality and duality theorems of nonlinear generalized disjunctive fractional programming

Describes a project that uses

Uses Software

• LINDO
• LINGO

This page was built for publication: An approximate approach for fractional programming with absolute-value functions

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