A practical approach to approximate bilinear functions in mathematical programming problems by using Schur's decomposition and SOS type 2 variables

DOI10.1057/PALGRAVE.JORS.2602052zbMATH Open1114.90096OpenAlexW2078838147MaRDI QIDQ3409575FDOQ3409575

Authors: P. Sahakij, Antonio J. Conejo, Steven A. Gabriel, R. García-Bertrand 

Publication date: 20 November 2006

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602052

Recommendations

• Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
• On decomposition in bilinear programming
• Numerical solution of bilinear programming problems
• A linear programming approach to solving a jointly constrained bilinear programming problem with special structure
• scientific article; zbMATH DE number 4104722

zbMATH Keywords

optimizationengineeringlinear programminginteger programmingnon-linear programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cited In (3)

• Inside-ellipsoid outside-sphere (IEOS) model for general bilinear feasibility problems: feasibility analysis and solution algorithm
• An SOS1-based approach for solving MPECs with a natural gas market application
• A branch-and-bound algorithm for instrumental variable quantile regression

This page was built for publication: A practical approach to approximate bilinear functions in mathematical programming problems by using Schur's decomposition and SOS type 2 variables

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