v1.6.0

Note: this release is fully compatible with Julia v0.7/1.0 and also with Julia v0.6.

Breaking changes

• removed the conversion constructor for HPolygon and HPolytope; use convert(HPolytope, S) and convert(HPolygon, S) instead (#978)

Features

• added most standard methods for UnionSet and UnionSetArray (#1012)
• added membership test for VPolytope (#999)
• added subset test for HPolyhedron (#975)
• added linear_map for more sets:
  • HPolyhedron (requires map to be invertible) and HPolytope (#980),
  • Intersection (#1065),
  • EmptySet (#1062),
  • HalfSpace (#1067)
• added split method for zonotopes (#1018)
• added use_type_assumption option to isbounded for thoroughly checking for boundedness of HPolytope and HPolygon (#978)
• added check_boundedness option to the constructor of HPolytope and HPolygon (#978)
• added constraints_list for Hyperplane and Line (#1046), LinearMap (#1058), Intersection and IntersectionArray (#1053)
• added tosimplehrep (#1053)
• added remove_redundant_constraints and remove_redundant_constraints! (#1053)
• added concrete intersection with LinearMap (#1069)
• added AbstractPolyhedron interface (#1077)

Bug fixes

• fixed isdisjoint between polyhedra (#1044)
• fixed tohrep of VPolygon (#1072)
• fixed an unbounded support value for an Intersection with a bounded set and an HPolyhedron (#1075)

Enhancements

• efficient concrete intersection with AbstractSingleton (#1027)
• intersection of polyhedra now makes use of remove_redundant_constraints by default, and it returns an empty set if the intersection is detected to be empty (#1040); use the use_polyhedra_interface=true keyword in intersection to get the old behavior
• isempty for HPolyhedron and HPolytope does not require Polyhedra anymore (#1056)