uni lu hpc school 2019
play

Uni.lu HPC School 2019 PS14: Distributed Mixed-Integer Programming - PowerPoint PPT Presentation

Uni.lu HPC School 2019 PS14: Distributed Mixed-Integer Programming (MIP) optimization with Cplex and Gurobi Uni.lu High Performance Computing (HPC) Team E. Kieffer University of Luxembourg (UL), Luxembourg http://hpc.uni.lu E. Kieffer &


  1. Uni.lu HPC School 2019 PS14: Distributed Mixed-Integer Programming (MIP) optimization with Cplex and Gurobi Uni.lu High Performance Computing (HPC) Team E. Kieffer University of Luxembourg (UL), Luxembourg http://hpc.uni.lu E. Kieffer & Uni.lu HPC Team (University of Luxembourg) Uni.lu HPC School 2019/ PS14 1 / 9 �

  2. Latest versions available on Github : UL HPC tutorials: https://github.com/ULHPC/tutorials UL HPC School: http://hpc.uni.lu/hpc-school/ PS14 tutorial sources: ulhpc-tutorials.rtfd.io/en/latest/maths/Cplex-Gurobi E. Kieffer & Uni.lu HPC Team (University of Luxembourg) Uni.lu HPC School 2019/ PS14 2 / 9 �

  3. E. Kieffer & Uni.lu HPC Team (University of Luxembourg) Uni.lu HPC School 2019/ PS14 3 / 9 �

  4. Main Objectives Usage of Cplex and Gurobi on the UL HPC Platform → sequentialy ֒ → multithreaded ֒ → multithreaded/distributed (hybrid) ֒ E. Kieffer & Uni.lu HPC Team (University of Luxembourg) Uni.lu HPC School 2019/ PS14 4 / 9 �

  5. CPLEX Optimization software for mathematical programming. Cplex optimizer can solve: → Mixed-Integer programming problems (MIP) ֒ → Very large linear programming problems (LP) ֒ → Non-convex quadratic programming problems (QP) ֒ → Convex quadratically constrained problems (QCP) ֒ E. Kieffer & Uni.lu HPC Team (University of Luxembourg) Uni.lu HPC School 2019/ PS14 5 / 9 �

  6. GUROBI Powerful optimization software, alternative to Cplex for solving. Additionnal features: → Mixed-Integer Quadratic Programming (MIQP) ֒ → Mixed-Integer Quadratic Constrained Programming (MIQCP) ֒ E. Kieffer & Uni.lu HPC Team (University of Luxembourg) Uni.lu HPC School 2019/ PS14 6 / 9 �

  7. On the UL HPC platform Both softwares can be loaded using the module command Both softwares can solve very large problems EXCEPT MIP => NP-hard => implicit tree search algorithms (Branch and Bound family) Branch and bound algorithms can be solved in parallel to speed up the optimisation: → For exact optimisation => limited instance size ֒ → For approximation wit guarantee can be really interesting (tuning ֒ the gap to optimality). E. Kieffer & Uni.lu HPC Team (University of Luxembourg) Uni.lu HPC School 2019/ PS14 7 / 9 �

  8. Tutorial Please go to https://ulhpc-tutorials.readthedocs.io/en/ latest/maths/Cplex-Gurobi/ E. Kieffer & Uni.lu HPC Team (University of Luxembourg) Uni.lu HPC School 2019/ PS14 8 / 9 �

  9. Thank you for your attention... Questions? http://hpc.uni.lu High Performance Computing @ uni.lu Prof. Pascal Bouvry Dr. Sebastien Varrette Valentin Plugaru Sarah Peter Hyacinthe Cartiaux Clement Parisot Dr. FrÃľderic Pinel Dr. Emmanuel Kieffer University of Luxembourg, Belval Campus Maison du Nombre, 4th floor 2, avenue de l’Université L-4365 Esch-sur-Alzette mail: hpc@uni.lu E. Kieffer & Uni.lu HPC Team (University of Luxembourg) Uni.lu HPC School 2019/ PS14 9 / 9 �

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend