A Cutting Plane Algorithm for Problems Containing Convex and Reverse Convex Constraints.
$20.00
{{option.name}}:
{{selected_options[option.position]}}
{{value_obj.value}}
"Convexity" or "Tui" cuts are combined with the support cuts of Kelley's cutting plane algorithm to solve a large class of nonconvex programming problems. This class is defined by problems with some constraints of the "reverse convex" variety, that ...
Show More
Show Less