On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization

DOI10.1007/s10479-015-1941-2zbMath1381.90044OpenAlexW2216329155MaRDI QIDQ1686496

David Canca, Pedro Luis González-R, José Luis Andrade-Pineda

Publication date: 15 December 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-015-1941-2

zbMATH Keywords

quantity discountscarrier selectionlogistics planningnon-convex routing costs

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Management decision making, including multiple objectives (90B50) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (3)

A multi-objective supplier selection framework based on user-preferences ⋮ Multivariate supplier selection for asymmetric specification region: using price and quality ⋮ A weight-consistent model for fuzzy supplier selection and order allocation problem

Cites Work

• A scenario-based stochastic model for supplier selection in global context with multiple buyers, currency fluctuation uncertainties, and price discounts
• Supplier selection and procurement decisions with uncertain demand, fixed selection costs and quantity discounts
• Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
• Exact algorithms for procurement problems under a total quantity discount structure
• Supplier selection and order lot sizing modeling: a review
• Nonconvex, lower semicontinuous piecewise linear optimization
• A general quantity discount and supplier selection mixed integer programming model
• An improved Benders decomposition applied to a multi-layer network design problem
• Multi-criteria decision making approaches for supplier evaluation and selection: a literature review
• Solving the staircase cost facility location problem with decomposition and piecewise linearization
• The deterministic multi-item dynamic lot size problem with joint business volume discount
• Approximately global optimization for assortment problems using piecewise linearization techniques
• Compact bidding languages and supplier selection for markets with economies of scale and scope
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• A network approach modeling of multi-echelon spare-part inventory system with backorders and quantity discount
• Speed-up Benders decomposition using maximum density cut (MDC) generation
• Locally ideal formulations for piecewise linear functions with indicator variables
• A heuristic for single-warehouse multiretailer supply chains with all-unit transportation cost discounts
• Network design and flow problems with cross-arc costs
• Using Piecewise Linear Functions for Solving MINLPs
• Combinatorial Benders Cuts for the Minimum Tollbooth Problem
• Effective Zero-Inventory-Ordering Policies for the Single-Warehouse Multiretailer Problem with Piecewise Linear Cost Structures
• A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
• A composite algorithm for a concave-cost network flow problem
• New formulation and relaxation to solve a concave-cost network flow problem
• Capacitated Network Design—Polyhedral Structure and Computation

This page was built for publication: On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization