Premium
Linear Programming with Inexact Data is NP‐Hard
Author(s) -
Rohn J.
Publication year - 1998
Publication title -
zamm ‐ journal of applied mathematics and mechanics / zeitschrift für angewandte mathematik und mechanik
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.449
H-Index - 51
eISSN - 1521-4001
pISSN - 0044-2267
DOI - 10.1002/zamm.19980781594
Subject(s) - linear programming , computer science , mathematics , algorithm , mathematical optimization
We prove that the problem of checking existence of optimal solutions to all linear programming problems whose data range in prescribed intervals is NP‐hard.