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

Global optimal solution to quadratic discrete programming problem with inequality constraints

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

DOI10.1007/978-3-319-58017-3_16zbMath1382.49037OpenAlexW2763342970MaRDI QIDQ1696983

David Yang Gao, Ning Ruan

Publication date: 15 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-58017-3_16


zbMATH Keywords

integer programmingcanonical dual methodquadratic discrete value selection


Mathematics Subject Classification ID

Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Variational inequalities (49J40) Duality theory (optimization) (49N15)


Related Items (3)

On canonical duality theory and constrained optimization problems ⋮ Canonical Duality-Triality Theory: Unified Understanding for Modeling, Problems, and NP-Hardness in Global Optimization of Multi-Scale Systems ⋮ On quadratically constrained quadratic optimization problems and canonical duality theory




This page was built for publication: Global optimal solution to quadratic discrete programming problem with inequality constraints

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