Abstract
The theory of linear parametric programming yields an apparatus, which renders possible a complex approach to specified problems, as the transportation problem with parameters as capacity constraints is. In the present paper important questions like the statement of solvability conditions or the determinstion of an implicite description of the solvability region for the above mentioned problem is studied. If the corresponding transportation problem is solved for a fixed parameter value, then the stability region of the optimal solutin of the transportation problem can implicitely be given by making use of the determination of the edge vectors starting in the optimal vertex of the dual restriction polyhedron. In order to determine optimal solutions of the transportation problem with capacity restrictions and of the corresponding dual problem as well as to determine the edge vectors, some procedures are given, which are based on the potential method.
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.
