Abstract
We consider herein a specific type of goal programming model, namely the lexicogrpahic linear goal programming model. Although the two most common methods of solution, the sequential process and the multiphase process, produce the same solutions, the interiors of the final tableaus will differ. We present algorithms which allow one to transform the sequential tableau into the multiphase tableau and vice versa and, in doing so, demonstrate the respective mathematical duals and their relationships. These results are particularly important when performing sensitivity analysis.
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.
