A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Solving Linear Programming with Constraints Unknown
[chapter]
2015
Lecture Notes in Computer Science
What is the value of input information in solving linear programming? The celebrated ellipsoid algorithm tells us that the full information of input constraints is not necessary; the algorithm works as long as there exists an oracle that, on a proposed candidate solution, returns a violation in the form of a separating hyperplane. Can linear programming still be efficiently solved if the returned violation is in other formats? Motivated by some real-world scenarios, we study this question in a
doi:10.1007/978-3-662-47672-7_11
fatcat:ui6idf3ayveexhztowamfri2j4