On decomposition in bilinear programming

DOI10.1080/02331938908843413MaRDI QIDQ3833874zbMATH OpenOpenAlexFDO

Authors Uwe Würker

Publication date 1989

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331938908843413

zbMATH Keywords

bilinear and convex constraintsbilinear optimizationDantzig-Wolfe decompositionmarginal functionoptimal value functionprimal decomposition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
• A linear programming approach to solving a jointly constrained bilinear programming problem with special structure
• A note on the solution of bilinear programming problems by reduction to concave minimization
• scientific article; zbMATH DE number 1375371
• scientific article; zbMATH DE number 2059740

Cites work

• Generalized Benders decomposition
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3446685 (Why is no real title available?)

Cited in

(3)

• A practical approach to approximate bilinear functions in mathematical programming problems by using Schur's decomposition and SOS type 2 variables
• Degeneracy removal in cutting plane methods for disjoint bilinear programming
• Degeneracy resolution for bilinear utility functions

This page was built for publication: On decomposition in bilinear programming

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