The words contained in this file might help you see if this file matches what you are looking for:

...Onobtaining the convex hull of quadratic inequalities via aggregations santanu s dey gonzalo munoz felipe serrano june abstract a classical approach for obtaining valid set involves weighted that describe such when is described by linear thanks to farkas lemma we know every inequality can be obtained using describing are two quadratics yildiran showed given at most aggregated in this work study case three or more show under technical assumptions potentially innitely many also through counterexamples it unlikely have similar result if either conditions relaxed consider four introduction feasible region constraints common relax ations process new re scaling scalar weights and then adding scaled together call aggregation nonempty nite number any implied an been studied context integer programming example obtain cutting planes mixed nonlinear better dual bounds paper interested understanding strength order sets dened authors shown as intersection fact each these may not on its own but thei...