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

Can linear programs be used to test global optimization algorithms?

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

DOI10.1007/BF02684406zbMath0881.90110MaRDI QIDQ1365543

Hoang Duong Tuan

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)


Related Items (1)

On global optimality conditions and cutting plane algorithms



Cites Work

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


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1365543&oldid=13513195"
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 16:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki