LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM

DOI10.1142/S0217595909002092zbMATH Open1188.90178OpenAlexW2044363664MaRDI QIDQ3632032FDOQ3632032

Authors: Reena Kapoor, S. R. Arora 

Publication date: 23 June 2009

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595909002092

Recommendations

• Linearization of a 0-1 quadratic fractional programming problem
• A new linearization technique for multi-quadratic 0-1 programming problems.
• A linearization framework for unconstrained quadratic (0-1) problems
• ``Miniaturized linearizations for quadratic 0/1 problems
• A linearization technique for quadratic integer programming with box constraint

zbMATH Keywords

quadratic programmingfractional programminglinearizationNP-hard0-1 programming

Mathematics Subject Classification ID

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

Cites Work

• Programming with linear fractional functionals
• Title not available (Why is that?)
• 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
• Complexity of uniqueness and local search in quadratic 0-1 programming
• A new linearization technique for multi-quadratic 0-1 programming problems.
• On the polynomial mixed 0-1 fractional programming problems

Cited In (4)

• Linearization of a 0-1 quadratic fractional programming problem
• A geometric branch-and-bound algorithm for the service bundle design problem
• Title not available (Why is that?)
• Equivalence of various linearization algorithms for linear fractional programming

This page was built for publication: LINEARIZATION OF 0-1 MULTI-QUADRATIC FRACTIONAL PROGRAMMING PROBLEM

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