A linear programming approach to solving a jointly constrained bilinear programming problem with special structure

MaRDI QIDQ1376664zbMATH OpenFDO

Authors J. Ning

Publication date 21 January 1998

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

zbMATH Keywords

nonconvex optimizationjointly constrained bilinear programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Jointly constrained bilinear programs and related problems: An overview
• A linear programming approach to solving bilinear programmes
• A new reformulation-linearization technique for bilinear programming problems

Cited in

(12)

• Efficient algorithms for solving rank two and rank three bilinear programming problems
• Linearity embedded in nonconvex programs
• Jointly constrained bilinear programs and related problems: An overview
• scientific article; zbMATH DE number 4061001 (Why is no real title available?)
• A new reformulation-linearization technique for bilinear programming problems
• On decomposition in bilinear programming
• A symmetrical linear maxmin approach to disjoint bilinear programming
• Generalized bilinear programming. I: Models, applications and linear programming relaxation
• A unified monotonic approach to generalized linear fractional programming
• A linear programming approach to solving bilinear programmes
• A practical approach to approximate bilinear functions in mathematical programming problems by using Schur's decomposition and SOS type 2 variables
• scientific article; zbMATH DE number 5189377 (Why is no real title available?)

This page was built for publication: A linear programming approach to solving a jointly constrained bilinear programming problem with special structure

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