Tulip is an open-source interior-point solver for linear optimization, written in pure Julia. It implements the homogeneous primal-dual interior-point algorithm with multiple centrality corrections and therefore handles unbounded and infeasible problems. Tulip’s main feature is that its algorithmic framework is disentangled from linear algebra implementations. This allows to seamless integration of specialized routines for structured problems.
Features
- Tulip is licensed under the MPL 2.0 license
- The recommended way of using Tulip is through JuMP or MathOptInterface (MOI)
- The type Tulip.Optimizer is parametrized by the model's arithmetic
- Documentation available
- Command-line executable
- Linear objectives, linear constraints and lower/upper bounds on variables are supported
Categories
Data VisualizationLicense
MIT LicenseFollow Tulip.jl
Other Useful Business Software
MongoDB Atlas runs apps anywhere
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Tulip.jl!