v0.2.2

BilevelOptimization v0.2.2

Diff since v0.2.1

Closed issues:

• Solver closure (#10)
• Switch to JuMP v0.19 & MOI (#13)
• Registration (#17)

Merged pull requests:

• citation document and DOI (#18) (@matbesancon)
• Add missing closing parenthese (#19) (@blegat)
• Minor edits to paper.md (#20) (@kyleniemeyer)
• Citation (#21) (@matbesancon)
• Jump 019 (#22) (@matbesancon)
• bump jump version, improve documentation (#23) (@matbesancon)
• Install TagBot as a GitHub Action (#24) (@JuliaTagBot)
• bumping JuMP (#25) (@matbesancon)

v0.2.1

v0.2.1 (2019-06-18)

Diff since v0.2.0

Closed issues:

• Documentation [JOSS] (#14)
• Cover broken (#12)
• Version Bump [JOSS] (#7)

Merged pull requests:

• extended doc, developed paper (#16) (matbesancon)
• completed docstring, README (#15) (matbesancon)

Generalized solution method

Complementarity constraints can now be solved in any user-defined way. The two methods proposed by the package are:

• Big M
• SOS1

Fixed UUID for METADATA

v0.1.1

bump version

Initial release

Working features, API documentation