Originally posted by: MaryFenelon
Event Date: Aug 20, 2014 (please note, this is a week earlier than our usual meeting date)
Event Time: 7:30 AM - 8:30 AM (Pacific Time)
Hosted By: Kitte Knight (IBM)
Presented By: Andrea Lodi (IBM)
Mixed Integer Linear Programming (MILP) models are commonly used to model indicator constraints, which either hold or are relaxed depending on the value of a binary variable. Classification problems with Ramp Loss functions are an important application of such models. Mixed Integer Nonlinar Programming (MINLP) models are usually dismissed because they cannot be solved as efficiently. However, we show here that a subset of classification problems can be solved much more efficiently by a MINLP model with nonconvex constraints. This calls for a reconsideration of the modeling of these indicator constraints, and we present several new results and interpretations obtained by digging into the relationship between MILP and MINLP.
Register for this event at:
https://events.na.collabserv.com/register.php?id=49d772e249&l=en-US
#CPLEXOptimizers#DecisionOptimization