Friedrich-Schiller-Universität Jena

Sie befinden sich hier:

Home  > Bensolve  

Bensolve

 

bensolvehedron            BENSOLVE is a solver for vector linear programs (VLP), in particular, for the subclass of multiple objective linear programs (MOLP). It is based on Benson's algorithm and its extensions. BENSOLVE is a free software published under the terms of the GNU General Public License. It utilizes the GNU Linear Programming Kit (GLPK). BENSOLVE (from version 2) is written in C programming language.

For further information and to download the latest version, visit:  

www.bensolve.org

or use the following link to a local repository

bt_logo

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

BENSOLVE TOOLS is an Octave/Matlab toolbox for polyhedral calculus and and polyhedral optimization. It is based on the VLP solver BENSOLVE. The 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
    • quasi-convace objective and linear constraints
    • possibility to exploit cone monotonicity
  • Multiobjective linear programming (MOLP)
  • Vector linear programming (VLP)

For further information and to download the latest version, visit:

http://tools.bensolve.org

or use the following link to a local repository