Uncertain Data Dependency Constraints in Matrix Models
Uncertain data due to imprecise measurements is commonly specified as bounded intervals in a constraint decision or optimization problem. Dependencies do exist among such data, e.g. upper bound on the sum of uncertain production rates per machine, sum of traffic distribution ratios from a router over several links. For tractability reasons existing approaches in constraint programming or robust optimization frameworks assume independence of the data. This assumption is safe, but can lead to large solution spaces, and a loss of problem structure. Thus it cannot be overlooked. In this paper we identify the context of matrix models and show how data dependency constraints over the columns of such matrices can be modeled and handled efficiently in relationship with the decision variables. Matrix models are linear models whereby the matrix cells specify for instance, the duration of production per item, the production rates, or the wage costs, in applications such as production planning, economics, inventory management. Data imprecision applies to the cells of the matrix and the output vector. Our approach contributes the following results: 1) the identification of the context of matrix models with data constraints, 2) an efficient modeling approach of such constraints that suits solvers from multiple paradigms. An illustration of the approach and its benefits are shown on a production planning problem.
KeywordsData uncertainty Data constraints Interval reasoning Interval linear programs
Unable to display preview. Download preview PDF.
- 4.Bertsimas, D., Brown, D.: Constructing uncertainty sets for robust linear optimization. Operations Research (2009)Google Scholar
- 6.Brown, K., Miguel, I.: Chapter 21: uncertainty and change. In: Handbook of Constraint Programming. Elsevier (2006)Google Scholar
- 7.Cheadle, A.M., Harvey, W., Sadler, A.J., Schimpf, J., Shen, K., Wallace, M.G.: ECLiPSe: An Introduction. Tech. Rep. IC-Parc-03-1, Imperial College London, London, UKGoogle Scholar
- 9.Fargier, H., Lang, J., Schiex, T.: Mixed constraint satisfaction: A framework for decision problems under incomplete knowledge. In: Proc. of AAAI-1996 (1996)Google Scholar
- 10.Gent, I., Nightingale, P., Stergiou, K.: QCSP-solve: A solver for quantified constraint satisfaction problems. In: Proc. of IJCAI (2005)Google Scholar
- 12.Inuiguchi, M., Kume, Y.: Goal programming problems with interval coefficients and target intervals. European Journl of Oper. Res. 52 (1991)Google Scholar
- 13.Medina, A., Taft, N., Salamatian, K., Bhattacharyya, S. Diot, C.: Traffic matrix estimation: existing techniques and new directions. In: Proceedings of ACM SIGCOMM02 (2002)Google Scholar
- 16.Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier (2006)Google Scholar
- 19.Van Hentenryck, P., Michel, L., Deville, Y.: Numerica: A Modeling Language for Global Optimization. The MIT Press, Cambridge Mass (1997) Google Scholar
- 20.Yorke-Smith, N., Gervet, C.: Certainty closure: Reliable constraint reasoning with uncertain data. In: ACM Transactions on Computational Logic 10(1) (2009)Google Scholar