Linearization of a 0-1 quadratic fractional programming problem

DOI10.1007/BF03398773zbMATH Open1153.90509OpenAlexW2773288250MaRDI QIDQ998699FDOQ998699

S. R. Arora, Reena Kapoor

Publication date: 9 February 2009

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398773

zbMATH Keywords

quadratic programmingfractional programminglinearization0-1 programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Fractional programming (90C32) Boolean programming (90C09)

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 (3)

• 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?)

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)