A CUTTING PLANE APPROACH FOR CHANCE CONSTRAINED LINEAR-PROGRAMS
Abstract
One approach for solving linear programs with random coefficients is chance constrained programming. For the case where the technical coefficients are normally distributed, we present a convergent cutting plane algorithm to solve the equivalent nonlinear program, which takes advantage of the characteristics of the problem. The algorithm requires a moderate computational effort and compares favorably with a general nonlinear code and other approaches proposed for solving this problem.
Más información
Título según WOS: | ID WOS:A1991GL75400008 Not found in local WOS DB |
Título de la Revista: | OPERATIONS RESEARCH |
Volumen: | 39 |
Número: | 5 |
Editorial: | INFORMS |
Fecha de publicación: | 1991 |
Página de inicio: | 776 |
Página final: | 785 |
DOI: |
10.1287/opre.39.5.776 |
Notas: | ISI |