Abstract:
The constraint programming paradigm has proved to have the flexibility and efficiency necessary to treat well-defined largescale optimisation (LSCO) problems. Many real world problems, however, are ill-defined, incomplete, or have uncertain data. Research on ill-defined LSCO problems has centred on modelling the uncertainties by approximating the state of the real world, with no guarantee as a result that the actual problem is being solved. We focus here on ill-defined data, motivated by problems from energy trading and computer network optimisation, where no probability distribution is known or can be usefully obtained. We suggest a non-probabilistic certainty closure approach to model the data uncertainty, discuss the formalism and semantics required to build a constraint solving system based on such a computation domain, and give examples in the case of linear systems.
Citations
|
330
|
Introduction to Interval Computations
– Alefeld, Herzberger
- 1983
|
|
295
|
Programming with Constraints: An Introduction
– Marriott, Stuckey
- 1998
|
|
237
|
Valued Constraint Satisfaction Problems: Hard and Easy Problems
– Schiex, Fargier, et al.
- 1995
|
|
118
|
Belief maintenance in dynamic constraint networks
– Dechter, Dechter
- 1988
|
|
89
|
Robust solutions of uncertain linear programs
– Ben-Tal, Nemirovski
- 1999
|
|
84
|
Linear programming under uncertainty
– Dantzig
- 1955
|
|
80
|
Uncertainty in Constraint Satisfaction Problems: a Probabilistic Approach
– Fargier, Lang
- 1993
|
|
64
|
Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty
– Dubois, Fargier, et al.
- 1996
|
|
57
|
Operations Research: An Introduction
– Taha
- 1997
|
|
42
|
Interval constraint logic programming
– Benhamou
- 1995
|
|
39
|
Robust solutions of Linear Programming problems contaminated with uncertain data
– Ben-Tal, Nemirovski
- 2000
|
|
21
|
Branching constraint satisfaction problems for solutions robust under likely changes
– Fowler, Brown
- 2000
|
|
13
|
Towards practical interval constraint solving in logic programming
– Chiu, Lee
- 1994
|
|
9
|
On refining ill-defined constraint problems: A case study in iterative prototyping
– Gervet, Caseau, et al.
- 1999
|
|
8
|
Interval linear constraint solving using the preconditioned interval Gauss-Seidel method
– Chiu, Lee
- 1995
|
|
7
|
Interval constraints
– Benhamou
- 2001
|
|
7
|
A comparison of some methods for solving linear interval equations
– Ning, Kearfott
- 1997
|
|
7
|
Constraint satisfaction with probabilistic preferences on variable values
– Shazeer, Littman, et al.
- 1999
|
|
6
|
On the solution set of a linear system with inaccurate coefficients
– Oettli
- 1965
|
|
5
|
Set-models of information-gap uncertainty: Axioms and an inference scheme
– Ben-Haim
- 1999
|
|
5
|
RiskWise-2 problem definition. IC--Parc Internal Report
– Gervet, Rodosek
- 2000
|
|
5
|
Combinatorial optimization: Current successes and directions for the future
– Hoffman
- 2000
|
|
4
|
Interpretation of inequality constraints involving interval coefficients and a solution to interval linear programming. Fuzzy Sets and Systems 119(1):129--138
– Sengupta, Pal, et al.
- 2001
|
|
4
|
Representing and coping with recurrent change in dynamic constraint satisfaction problems
– Wallace, Freuder
- 1999
|
|
3
|
The solution of linear interval equations by a linear programming method. Linear Algebra and its Applications 259:271--279
– Aberth
- 1997
|
|
3
|
Solving interval linear systems with linear programming techniques. Linear Algebra and its Applications 281:293--309
– Beaumont
- 1998
|
|
3
|
Linear programming with interval coefficients
– Chinneck, Ramadan
- 2000
|
|
2
|
Uncertain programming: Optimization theory in uncertain environments
– Liu
|
|
2
|
Interval Methods for Systems of Equations. Number 37
– Neumaier
- 1990
|
