## Mathematical programming techniques for solving stochastic optimization problems with certainty equivalent measures of risk

- Alexander Vinel, Andrew Kusiak, +6 authors Karla Stout
- 2016

Highly Influenced

4 Excerpts

- Published 1994 in Computers & OR

This report describes a branch and bound code for zero one mixed integer nonlinear programs with convex objective functions and constraints The code uses heuristics to detect subproblems which do not have inte gral solutions When the code detects such a subproblem it creates two new subproblems instead of solving the current problem to optimality Computational results on sample problems show that these heuristics can signi cantly decrease solution times for some problems Research partially supported by ONR Grant number N J This paper is taken in part from a thesis to be submitted by Brian Borchers in partial ful llment for the degree of Doctor of Philosophy in the Department of Mathematical Sciences at Rensselaer Polytechnic Institute

Citations per Year

Semantic Scholar estimates that this publication has **109** citations based on the available data.

See our **FAQ** for additional information.

@article{Borchers1994AnIB,
title={An improved branch and bound algorithm for mixed integer nonlinear programs},
author={Brian Borchers and John E. Mitchell},
journal={Computers & OR},
year={1994},
volume={21},
pages={359-367}
}