[APDIO] Invitation to "Is CPLEX like a box of chocolates?"

[Isabel Gomes <mirg@fct.unl.pt>]

Dear colleagues,

Next Friday, the 23rd of May, we will host at FCT/UNL, a short course
on CPLEX entitled "Is CPLEX like a box of chocolates?". The course
will be taught in English by Ricardo Lima, a Marie Curie Fellow at the
National Laboratory of Energy and Geology (LNEG). Please find below
the course summary and Ricardo's short bio.

In order to register you should fill the registration form and send
Isabel (mirg@fct.unl.pt) together with a copy of the bank transfer.
The form is in Portuguese. If assistance is needed don't hesitate to
contact us.

Hoping to hear from you,
Isabel Gomes and Susana Baptista

site: http://apdio.pt/organizados-pela-apdio/-/asset_publisher/HtBTR0yCYtg0/content/2014-05-23-is-cplex-like-a-box-of-chocolates-?redirect=http%3A%2F%2Fapdio.pt%2Forganizados-pela-apdio%3Fp_p_id%3D101_INSTANCE_HtBTR0yCYtg0%26p_p_lifecycle%3D0%26p_p_state%3Dnormal%26p_p_mode%3Dview%26p_p_col_id%3Dcolumn-1%26p_p_col_count%3D1

Abstract:
This short course addresses some of the recent features and
capabilities of the optimization software package CPLEX, which have
been contributing for the solution of increasing size problems. In the
last years CPLEX has incorporated several developments at the level of
solving linear programming (LP) problems, pre-processing, cutting
planes, heuristics, and auxiliary tools. The presentation starts with
an overview of the CPLEX history, and the type of the problems it can
solve. The main focus is the solution of mixed integer linear
programming (MILP) problems, and the discussion of both established
and new methods used in the branch and cut (B&C) algorithm to solve
MILP problems. Examples of new methods are heuristics such as Local
Branching (LB), Relaxation Induced Neighborhood Search (RINS) and
evolutionary algorithms for polishing MILP solutions. These heuristics
explore the neighborhood of integer solutions by solving sub-MILPs,
while maintaining the logic inherent to the upper and lower bounds of
the B&C algorithm. Another interesting feature is the possibility of
using multiple CPU threads to solve LP problems, and search the B&C
tree. The solution of Boolean Quadratic Problems (BQP) using MILP
reformulations, by direct solution with CPLEX, GUROBI, and XPRESS as a
Mixed Integer Quadratic Programming (MIQP) problem, and using
callbacks with CPLEX will be also covered. The convexification of BQP
problems and the consequent solution by CPLEX will be briefly
addressed. The results of computational experiences and several
examples that evaluate the performance of these methods will be
presented and discussed.

Short bio:
Ricardo M. Lima is a Marie Curie Fellow at the National Laboratory of
Energy and Geology (LNEG) in Lisbon, Portugal. He received the
Licentiate degree in 1999, and the Ph.D. degree in 2006, both in
Chemical Engineering from the Faculty of Engineering, University of
Porto, Portugal. He has worked with Ignacio E. Grossmann as a post-doc
fellow in the Department of Chemical Engineering at the Carnegie
Mellon University (CMU), PA, USA in 2006-2008, and has continued as a
Researcher at the CMU in 2008-2011, with a joint position as Invited
Researcher in PPG Industries in 2008-2011. He joined LNEG in 2011. His
main research interests include mathematical programming, robust
optimization, applied optimization, energy systems, and the design and
scheduling/planning of industrial processes.
-- 

-- 
Maria Isabel Gomes, PhD

Departamento de Matemática (Department of Mathematics)

Faculdade de Ciências e Tecnologia - UNL

2829-516 Caparica, Portugal

Tel: +351212948388    Fax: +351212948391

www.docentes.fct.unl.pt/mirg