In general, a proposed solution to an optimization problem that does not satisfy all the constraints. For the linear-programming problem Ax = b, x ≥ 0, a vector x0 is an infeasible solution if it does not fully satisy the equations or the nonnegativity condition.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this entry
Cite this entry
(2013). Infeasible Solution. In: Gass, S.I., Fu, M.C. (eds) Encyclopedia of Operations Research and Management Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-1153-7_200319
Download citation
DOI: https://doi.org/10.1007/978-1-4419-1153-7_200319
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-1137-7
Online ISBN: 978-1-4419-1153-7
eBook Packages: Business and Economics