Cutting-plane method
id:
cutting-plane-method-313-17140210
title:
Cutting-plane method
text:
In mathematical optimization, the cutting-plane method is any of a variety of optimization methods that iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts. Such procedures are commonly used to find integer solutions to mixed integer linear programming (MILP) problems, as well as to solve general, not necessarily differentiable convex optimization problems. The use of cutting planes to solve MILP was introduced by Ralph E. Gomory. Cutting plane me
brand slug:
wiki
category slug:
encyclopedia
description:
Optimization technique for solving (mixed) integer linear programs
original url:
https://en.wikipedia.org/wiki/Cutting-plane_method
date created:
date modified:
2023-12-10T09:57:52Z
main entity:
{"identifier":"Q1762039","url":"https://www.wikidata.org/entity/Q1762039"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/3/31/TSP_cutting_plane.png","width":983,"height":733}
fields total:
13
integrity:
15