Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:Mathematical_optimization_method
|
| gptkbp:appliesTo |
gptkb:Convex_sets
Linear inequalities |
| gptkbp:approach |
Iterative
|
| gptkbp:category |
gptkb:mathematical_optimization
gptkb:Optimization_algorithm Operations research |
| gptkbp:developedBy |
gptkb:George_Dantzig
gptkb:Ralph_Gomory |
| gptkbp:firstDescribed |
1950s
|
| gptkbp:notableFor |
gptkb:Polyhedral_combinatorics
gptkb:mathematical_optimization Solving mixed-integer linear programs |
| gptkbp:purpose |
To solve optimization problems by iteratively refining feasible region
|
| gptkbp:relatedTo |
gptkb:Simplex_method
gptkb:Branch_and_bound Ellipsoid method |
| gptkbp:usedIn |
gptkb:Integer_programming
Linear programming Convex optimization |
| gptkbp:bfsParent |
gptkb:Network_Optimization
gptkb:Integer_Programming gptkb:Linear_Programming_Relaxation |
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Cutting Plane Method
|