Abstract
This note gives a synopsis of new methods for solving linear systems and linear programming problems with uncertain data. All input data can vary between given lower and upper bounds. The methods calculate very sharp and guaranteed error bounds for the solution set of those problems and permit a rigorous sensitivity analysis. For problems with exact input data in general the calculated bounds differ only in the last bit in the mantissa, i.e. they are of maximum accuracy.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
