Abstract
We present a new definition of optimality intervals for the parametric right-hand side linear programming (parametric RHS LP) Problem ź(ź) = min{c t x¦Ax =b + ź¯b,x ź 0}. We then show that an optimality interval consists either of a breakpoint or the open interval between two consecutive breakpoints of the continuous piecewise linear convex function ź(ź). As a consequence, the optimality intervals form a partition of the closed interval {ź; ¦ź(ź)¦ < ź}. Based on these optimality intervals, we also introduce an algorithm for solving the parametric RHS LP problem which requires an LP solver as a subroutine. If a polynomial-time LP solver is used to implement this subroutine, we obtain a substantial improvement on the complexity of those parametric RHS LP instances which exhibit degeneracy. When the number of breakpoints of ź(ź) is polynomial in terms of the size of the parametric problem, we show that the latter can be solved in polynomial time.
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.
