Abstract
The problem addressed in this paper is related to an aerospace company seeking to change its outsourcing strategies in order to meet the expected demand increase and customer satisfaction requirements regarding delivery dates and amounts. A bilinear goal programming model is developed to achieve the company's objectives. A modified Benders decomposition method is successfully applied to handle bilinear goal programming models in which the complicating binary variables affect the values of the deviational variables of goals attainment. This influence leads to formulate the master and the sub-problem as two goal programming models with different objective function decompositions as compared to the classical Benders one. Computational experiments show that the modified Benders algorithm outperforms a generic linearization method by reaching the optimal solution for larger problem with about 75% reduction in computation time.
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.
