Discrete optimization with bilinear objective function and linear constraints

From MaRDI portal





The authors reduce a mixed integer program with bilinear objective function and linear constraints to a mixed integer linear program by using the extreme points of the original polytope. For the entire collection see [Zbl 0778.00028].











This page was built for publication: Discrete optimization with bilinear objective function and linear constraints

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