Linearization of a 0-1 quadratic fractional programming problem
From MaRDI portal
Publication:998699
DOI10.1007/BF03398773zbMATH Open1153.90509OpenAlexW2773288250MaRDI QIDQ998699FDOQ998699
Authors: Reena Kapoor, S. R. Arora 
Publication date: 9 February 2009
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf03398773
Recommendations
- LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM
- A short note on the mixed (0,\,1) linear fractional programming problem
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A new linearization technique for multi-quadratic 0-1 programming problems.
- A note on a global approach for general 0-1 fractional programming
Cites Work
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- A note on a global approach for general 0-1 fractional programming
- A global approach for general \(0-1\) fractional programming
- Fractional programming: Applications and algorithms
- A new linearization technique for multi-quadratic 0-1 programming problems.
- An efficient linearization approach for mixed-integer problems
- On the polynomial mixed 0-1 fractional programming problems
Cited In (7)
- A novel approach for solving quadratic fractional programming problems
- A short note on the mixed (0,\,1) linear fractional programming problem
- A linear-fractional programming problem in singular cases
- Title not available (Why is that?)
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- A variable reduction method for fractional quadratic programming problem
- LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM
This page was built for publication: Linearization of a 0-1 quadratic fractional programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998699)
