bnbs

The NEOS Server offers BNBS for the solution of multi-stage stochastic LP problems. The problems have to be in SMPS format. Note that names should start with a letter.

BNBS uses a "Bouncing" Nested Benders Solver (decomposition). It utilizes either CPLEX, SOPLEX, or GLPK as LP solver. For more information on the algorithm, see the BNBS homepage.

The BNBS algorithm was developed by Fredrik Altenstedt.

This solver was implemented by Hans Mittelmann and executes at

Using the NEOS Server for BNBS

The user must submit a stochastic LP in SMPS format.
Note that names should start with a letter. BNBS cannot handle integer constraints.
This is the default commands file. Here are explanations.
Examples of problems in SMPS format can be found here.

Enter the complete path to the
CORE file:

Enter the complete path to the
TIME file:

Enter the complete path to the
STOCH file:

Enter the complete path to the
Commands file (optional):

Which LP solver do you want to use?
Algorithm:

Comments:

e-mail address:

Please do not click the 'Submit to NEOS' button more than once.

_{DOE disclaimer

DOE Web privacy policy}