Global optimal solution to quadratic discrete programming problem with inequality constraints
From MaRDI portal
Recommendations
- Global optimality sufficient conditions for quadratic programming problem with inequality constraints
- Global optimization of quadratic programming problems with quadratic constraints
- Global optimality conditions and optimization methods for quadratic integer programming problems
- Global solution of non-convex quadratically constrained quadratic programs
- Global optimality conditions for quadratic optimization problems with binary constraints
- Global optimization of a quadratic functional with quadratic equality constraints
- Global optimality conditions for mixed integer quadratic programming problems
- scientific article; zbMATH DE number 1694906
- Global optimality conditions and optimization methods for quadratic assignment problems
- Global optimization solutions to a class of nonconvex quadratic minimization problems with quadratic constraints
Cited in
(4)- 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
- Solutions to quadratic minimization problems with box and integer constraints
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1696983)