Abstract
Jenkins developed an heuristic algorithm for performing the right-hand-side parametric analysis of a Mixed Integer Linear Programming (MILP) problem with an approach completely different from all previous work in the area: his method can use any software capable of solving MILP problems and able to perform parametric linear programming (PLP). There is no proof of completeness by using Jenkins's algorithm. In this paper we present results that allow us to verify the completeness of the parametrical analysis. Like Jenkins's algorithm our procedure is theoretically independent of the solution method to solve a point-value problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
