Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  introduces a fundamental family of unbounded convex sets that arises in the context of non-convex mixed-integer quadratic programming. It is shown that any mixed-integer quadratic program with linear constraints can be reduced to the minimisation of a linear function over a face of a set in the family. Some fundamental properties of the convex sets are derived, along with connections to some other ll-studied convex sets. Several classes of valid and facet-inducing inequalities are also derived.
['Samuel Burer', 'Adam N. Letchford']
I am writing a research paper on a idea Unbounded convex sets for non-convex mixed-integer quadratic programming
[{"from": "human", "value": "I am writing a research paper on a idea Unbounded convex sets for non-convex mixed-integer quadratic programming"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  introduces a fundamental family of unbounded convex sets that arises in the context of non-convex mixed-integer quadratic programming. It is shown that any mixed-integer quadratic program with linear constraints can be reduced to the minimisation of a linear function over a face of a set in the family. Some fundamental properties of the convex sets are derived, along with connections to some other ll-studied convex sets. Several classes of valid and facet-inducing inequalities are also derived."}]