Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:28, 3 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving convex MINLP optimization problems using a sequential cutting plane algorithm |
scientific article |
Statements
Solving convex MINLP optimization problems using a sequential cutting plane algorithm (English)
0 references
28 September 2006
0 references
convex programming
0 references
branch and bound
0 references
cutting plane algorithms
0 references
mixed integer nonlinear programming
0 references