A Class of Variance-Constrained Problems

Published Online:https://doi.org/10.1287/opre.31.2.338

A Lagrange multiplier solution procedure is developed for a class of variance-constrained problems. The method, based on the separation of the variance and an algorithm for determining the optimal value of the mean, relies on the availability of a method of solving a modified problem in which the variance operation is replaced by the generalized variance operator. It is indicated that the procedure can be used in conjunction with dynamic programming to solve a variety of variance-constrained problems which allow the consideration of adaptive strategies. The procedure is demonstrated by a simple numerical example.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.