Efficient methods for solving certain bilinear programming problems

MaRDI QIDQ1376672zbMATH OpenFDO

Authors Le Dung Muu, Bui The Tam

Publication date 21 January 1998

Published in Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

nonconvex programmingindefinite quadratic problems

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
• Efficient algorithms for solving rank two and rank three bilinear programming problems
• Note on solving linear complementarity problems as jointly constrained bilinear programs
• Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions

Cited in

(5)

• Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
• Efficient solvers for the IBC method
• An Efficient Algorithm for Solving General Linear Two-Point BVP
• Efficient algorithms for solving rank two and rank three bilinear programming problems
• Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions

This page was built for publication: Efficient methods for solving certain bilinear programming problems

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