Checking solvability of systems of interval linear equations and inequalities via mixed integer programming Academic Article

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 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. 2008 Elsevier B.V. All rights reserved.

authors

• Butenko, Sergiy

published proceedings

• EUROPEAN JOURNAL OF OPERATIONAL RESEARCH

author list (cited authors)

• Prokopyev, O. A., Butenko, S., & Trapp, A.

citation count

• 22

complete list of authors

• Prokopyev, Oleg A||Butenko, Sergiy||Trapp, Andrew

publication date

• January 2009

publisher

• Elsevier  Publisher

published in

• European Journal of Operational Research  Journal

keywords

• Farkas Lemina
• Interval Linear Systems
• Mixed Integer Programming
• Solvability

Digital Object Identifier (DOI)

• 10.1016/j.ejor.2008.11.008

start page

• 117

end page

• 121

volume

• 199

issue

• 1

URL

• http://dx.doi.org/10.1016/j.ejor.2008.11.008

user-defined tag

• 10 Reduced Inequalities