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

zbMATH Open0885.90092MaRDI QIDQ1376664FDOQ1376664

Authors: J. Ning 

Publication date: 21 January 1998

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

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

zbMATH Keywords

nonconvex optimizationjointly constrained bilinear programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cited In (12)

• Efficient algorithms for solving rank two and rank three bilinear programming problems
• Linearity embedded in nonconvex programs
• Title not available (Why is that?)
• Jointly constrained bilinear programs and related problems: An overview
• 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
• Title not available (Why is that?)

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)