Gröbner and Graver bases for calculating Opportunity Cost Matrices

Abstract

Opportunity cost matrices are interesting in the context of scenario reduction. We provide new algorithms, based on ideas from algebraic geometry, to efficiently compute the opportunity cost matrix using computational algebraic geometry. We demonstrate the efficacy of our algorithms by computing opportunity cost matrices for two stochastic integer programs.

15 pages, 3 figures