*bensolve tools* provides commands for the calculus of convex polyhedra and polyhedral convex functions. The package also contains different optimization solvers.

*bensolve tools* is a free software published under the terms of the GNU General Public License. It utilizes the VLP solver BENSOLVE and the GNU Linear Programming Kit (GLPK).

Main features of the current version are:

- Calculus of Convex Polyhedra
- computing H-representation and V-representation
- computing an inequality representation (H-representation)
- image and inverse image under linear transformation
- lineality space, affine hull, dimension, recession cone
- conic hull of a polyhedron
- adjacency list, facet-vertex incidence list
- Minkowski sum of n polyhedra
- intersection and closed convex hull of the union of n polyhedra
- cartesian product of n polyhedra
- polar and polar cone of a polyhedron
- normal cone of a polyhedron at a point
- comparing polyhedra: subset, proper subset, equality
- plotting 2d and 3d polyhedra
- Calculus of Polyhedral Convex Functions
- pointwise maximum of n polyhedral functions
- lower closed convex envelope of n polyhedral functions
- infimal convolution of n polyhedral functions
- pointwise sum of n polyhedral functions
- conjugate of a polyhedral function
- recession function of a polyhedral function
- domain, range, level sets, recession cone of a polyhedral function
- subdifferential at some point
- test for pointwise ordering and equality of two polyhedral functions
- plot of polyhedral functions with one or two variables
- Solving Linear Programs and Polyhedral Convex Programs (GLPK interface)
- Global Optimization Solver
- quasi-convace objective and linear constraints
- possibility to exploit cone monotonicity
- Multiple Objective Linear Programming Solver (BENSOLVE interface)
- Vector Linear Programming Solver (BENSOLVE interface)