Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477185 | European Journal of Operational Research | 2009 | 5 Pages |
Abstract
This paper deals with the problems of checking strong solvability and feasibility of linear interval equations, checking weak solvability of linear interval equations and inequalities, and finding control solutions of linear interval equations. These problems are known to be NPNP-hard. We use some recently developed characterizations in combination with classical arguments to show that these problems can be equivalently stated as optimization tasks and provide the corresponding linear mixed 0–1 programming formulations.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Oleg A. Prokopyev, Sergiy Butenko, Andrew Trapp,