Release Notes for Minotaur v0.4.1
Features:
- Simple presolve for all handlers.
- Products of binary variables and products of a binary variable with continuous variable are linearized.
- Fix and propagate heuristic.
- Linear constraints are classified based on specific structures.
- Cut selection and filtering of simplex based cuts.
- Quadratic functions are stored as a dictionary of keys instead of computational graphs for all solvers.
- Root relaxer can provide a feasible solution to the solution pool.
- Heuristics to run on original problem instead of transformed problem.
- Option to assume a problem is nonconvex and hence disable convexity detection.
- mglob will call mbnb for convex mixed-binary qp.
- Heuristic to find solution based on lock numbers.
Fixes:
- Fixes in LP Engine when objective is absent.
- Fixed a bug in calculating problem size when a new constraint is added.
- Fixed a numerical issue while OBBT.
- Fixed variable addition in AMPL interface.
- Bug fixes in nonlinear presolve.
- Checking feasibility of solution provided by NLP engine when no candidates to branch in mglob.
- Fix in calculating upper bound of the tree after root relaxation is created.
- Correctly do backward bound propagation for product of variables.
- Added default bounds in transformer.