{ "items" : [
    { "id" : "http://dbpedia.org/resource/Cutting-plane_method"
      "properties" : {
        "http://www.w3.org/2000/01/rdf-schema#comment" : [ "In mathematical optimization, the cutting-plane method is an umbrella term for optimization methods which iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts.  Such procedures are popularly 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."] } } }
