Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 199, Issue 1, Pages 117-121Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2008.11.008
Keywords
Interval linear systems; Mixed integer programming; Solvability; Farkas lemina
Funding
- AFOSR
- NSF [CMMI-0825993]
- US Department of Education [P200A060149]
- Div Of Civil, Mechanical, & Manufact Inn
- Directorate For Engineering [0825993] Funding Source: National Science Foundation
Ask authors/readers for more resources
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 NP-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. (C) 2008 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available