Unraveling complexities: Harnessing graph theory and optimization for real-world problem solving

In an era where intricate systems and complex data structures are pervasive, bridging the gap between theoretical methods and practical problem-solving becomes crucial. Elytica cordially invites you to our tutorial session at the forthcoming Annual ORSSA conference. This tutorial is geared towards anyone interested in leveraging the potential of modern computational techniques to solve real-world prescriptive analytics problems.

​

Our team of experts will delve into the crossroads of Mixed Integer Linear Programming (MILP) and graph theory, explaining how they are complementary in formulating and solving multifaceted optimization problems. We will place a particular emphasis on network design and flow optimization problems, commonly encountered in logistics, supply chain management, telecommunications, and transportation.

​

The tutorial will guide attendees through the nuances of formulating optimization problems using logical decision variables and graph theoretic principles, primarily focusing on flow conservation modelling. We will demonstrate how our cloud-based platform harnesses these methodologies, offering optimization, simulation, and predictive modelling as a service.

Attendees of the tutorial will be given the exciting opportunity to participate in an optimization modeling competition, which will be hosted as part of the tutorial session. There is a cash prize of R3500 up for grabs for the first place winner and a R1500 cash prize for the runner up. Attend the tutorial for more information and to enter the competition!