Assigning orders to suppliers with linear piecewise concave costs

Albert Corominas, Amaia Lusa

Abstract


Purpose: Once a set of suppliers has been determined, according to criteria of quality, price and reliability, among others, there remains the problem of assigning orders to the selected suppliers, in order to cover the needs at the lowest cost. We consider the case in which the needs of a component for a set of plants should be covered by suppliers with linear piecewise concave cost functions, a lower bound on the order size for the non-zero deliveries and a capacity constraint. The purpose is to design procedures for solving this problem.

Design/methodology/approach: With the aim of providing practical tools to solve the problem of assigning orders to suppliers with linear piecewise concave costs, two mixed integer linear programs are proposed.

Findings: The two MILP models are compared through an extensive computational experiment. This shows that both models, with a slight advantage for one of them, can be solved within a very short time, even when the dimensions of the instance largely exceed those that can occur in real cases.

Originality/value: The paper proposes novel models that can be used to solve the problem to optimality in reasonable times and with standard optimization software.

Keywords


supply management, linear piecewise concave cost, mixed integer linear programming

Full Text:

PDF


DOI: http://dx.doi.org/10.3926/jiem.2820


Licencia de Creative Commons 

This work is licensed under a Creative Commons Attribution 4.0 International License

Journal of Industrial Engineering and Management, 2008-2019

Online ISSN: 2013-0953; Print ISSN: 2013-8423; Online DL: B-28744-2008

Publisher: OmniaScience