Integer quadratic fractional programming problems with bounded variables

DOI10.1007/s10479-017-2484-5zbMath1411.90333OpenAlexW2604876701MaRDI QIDQ1730454

Kalpana Dahiya, Ekta Jain, Vanita Verma

Publication date: 6 March 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2484-5

zbMATH Keywords

rankinglinear fractional programmingfractional programmingquadratic fractional programminginteger feasible solution

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Fractional programming (90C32)

Related Items (2)

A branch-and-cut technique to solve multiobjective integer quadratic programming problems ⋮ Solving multi-objective integer indefinite quadratic fractional programs

Cites Work

• Minimization of the sum of three linear fractional functions
• Solving the sum-of-ratios problem by an interior-point method
• Ranking in integer programming with bounded variables.
• On Maximizing a Sum of Ratios
• A note on integer linear fractional programming
• ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
• A note on the sum of a linear and linear-fractional function
• Programming with linear fractional functionals
• On Nonlinear Fractional Programming
• SOME ASPECTS OF LINEAR FRACTIONAL FUNCTIONALS PROGRAMMING
• Unnamed Item

This page was built for publication: Integer quadratic fractional programming problems with bounded variables