Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Can linear programs be used to test global optimization algorithms?

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

DOI10.1007/BF02684406zbMATH Open0881.90110MaRDI QIDQ1365543FDOQ1365543


Authors: Hoang Duong Tuan Edit this on Wikidata


Publication date: 4 September 1997

Published in: Computing (Search for Journal in Brave)






zbMATH Keywords

global optimizationtest problemscritical remarks


Mathematics Subject Classification ID

Nonlinear programming (90C30)


Cites Work

  • On the construction of test problems for concave minimization algorithms
  • Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems


Cited In (2)

  • On global optimality conditions and cutting plane algorithms
  • Can linear superiorization be useful for linear optimization problems?





This page was built for publication: Can linear programs be used to test global optimization algorithms?

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1365543&oldid=13513195"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 15:01. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki