Abstract
In Chap. 8 we introduced linear programming optimization problems. Then, in Chap. 9, we rephrased PCFP as one such problem. By doing so, we could apply an interior-point method to the latter and obtain an algorithm solving PCFP with a complexity bounded by a low-degree polynomial in n,m and Open image in new window . A question conspicuously left open is the solution of the optimization problem itself. The main theorem of Chap. 9 provides a key step of this solution but leaves at least two aspects untouched: the initial feasible point is assumed to be given and there is no hint as how to deduce, at some moment of the process, the optimizers and optimal value.
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.
