Select one of the following problems to submit to nsips. The job results will be displayed on your browser. The tokens to delimit files as shown in the sample submissions are inserted automatically when using the Web forms.
Elke1 (A Robotics path planning problem, uses bspline library
Liu3 (quadratic objective, linear constraints)
Polak1 (generalized min-max problem)
PriceS6 (example from Price thesis)
Watson1 (quadratic objective, quadratic constraints)
Please do not click the 'Submit to NEOS' button more than once.