Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient methods for solving certain bilinear programming problems

From MaRDI portal
Publication:1376672
Jump to:navigation, search

zbMath0889.90139MaRDI QIDQ1376672

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)


Related Items (1)

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1376672&oldid=13526130"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:16.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki