IntervalConstraintProgramming.jl

GitHub repository

Introduction

This Julia package allows us to specify a set of constraints on real-valued variables, given by inequalities, and rigorously calculate (inner and outer approximations to) the feasible set, i.e. the set that satisfies the constraints. The package is based on interval arithmetic using the IntervalArithmetic.jl package.

Authors

• David P. Sanders, Departamento de Física, Facultad de Ciencias, Universidad Nacional Autónoma de México (UNAM)

Contributors

• yashcodes

Related content

Docs

• IntervalConstraintProgramming.jl tutorial

• API docs

Applications

• Polyhedral approximations with LazySets