Integrated analytical hierarch process and mathematical programming to supplier selection problem with quantity discount

In this article an integration of analytical hierarchy process and non-linear integer and multi-objective programming under some constraints such as quantity discounts, capacity, and budget is applied to determine the best suppliers and to place the optimal order quantities among them. This integration-based multi-criteria decision making methodology takes into account both qualitative and quantitative factors in supplier selection. While the analytical hierarchy process matches item characteristics with supplier characteristics, non-linear integer programming model analytically determines the best suppliers and the optimal order quantities among the determined suppliers. The objectives of the mathematical models constructed are maximizing the total value of purchase (TVP), minimizing the total cost of purchase (TCP) or maximizing TVP and minimizing TCP simultaneously. In addition, several “what if” scenarios are facilitated and the quality of the resulting models is evaluated on real-life data.     

A manufacturer's optimal quantity discount strategy and return policy through game-theoretic approach

This study generalised the traditional quantity discount problem with return contracts, in which a manufacturer promises to refund some fraction of the retailer's wholesale price if an item is returned, as a two-stage game. In the first stage the manufacturer and retailer determine the inventory level cooperatively. In the second stage, the manufacturer bargains with the retailer for quantity discount and return schemes to maintain channel efficiency. A menu of discount–return combinations is proposed for the manufacturer to make inventory decisions. The model developed will demonstrate that the return policy can be considered as mirror images of quantity discount strategy. That is, options with more generous return privileges are coupled with higher wholesale prices, whereas the lowest wholesale price comes with very strict limits on returns and a restocking fee for any returned goods.     

The multi-product newsboy problem with supplier quantity discounts and a budget constraint

This paper considers the multi-product newsboy problem with both supplier quantity discounts and a budget constraint, while each feature has been addressed separately in the literature. Different from most previous nonlinear optimization models on the topic, the problem is formulated as a mixed integer nonlinear programming model due to price discounts. A Lagrangian relaxation approach is presented to solve the problem. Computational results on both small and large-scale test instances indicate that the proposed algorithm is extremely effective for the problem. An extension to multiple constraints and preliminary computational results are also reported.     

Exact algorithms for procurement problems under a total quantity discount structure

In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This policy implies that every supplier announces a number of volume intervals and that the volume interval in which the total amount ordered lies determines the discount. Moreover, the discounted prices apply to all goods bought from the supplier, not only to those goods exceeding the volume threshold. We refer to this cost-minimization problem as the total quantity discount (TQD) problem. We give a mathematical formulation for this problem and argue that not only it is NP-hard, but also that there exists no polynomial-time approximation algorithm with a constant ratio (unless P = NP). Apart from the basic form of the TQD problem, we describe four variants. In a first variant, the market share that one or more suppliers can obtain is constrained. Another variant allows the buyer to procure more goods than strictly needed, in order to reach a lower total cost. We also consider a setting where the buyer needs to pay a disposal cost for the extra goods bought. In a third variant, the number of winning suppliers is limited, both in general and per product. Finally, we investigate a multi-period variant, where the buyer not only needs to decide what goods to buy from what supplier, but also when to do this, while considering the inventory costs. We show that the TQD problem and its variants can be solved by solving a series of min-cost flow problems. Finally, we investigate the performance of three exact algorithms (min-cost flow based branch-and-bound, linear programming based branch-and-bound, and branch-and-cut) on randomly generated instances involving 50 suppliers and 100 goods. It turns out that even the large instances of the basic problem are solved to optimality within a limited amount of time. However, we find that different algorithms perform best in terms of computation time for different variants.     

The optimal harvesting policy for non-autonomous populations with discount

Infinite horizon and non-autonomous optimal harvesting problems with discounted instantaneous utility are considered in this work. We first show that the optimal harvesting policy exists for a class of single populations by using the maximum principle. Second, the explicit expressions for the optimal harvesting policy and the maximum yields of logistic, Gompertz and Gilpin–Ayahs systems are obtained.     

A quantity discount approach to supply chain coordination

Quantity discounts provide a practical foundation for inventory coordination in supply chains. However, typical supply chain participants may encounter difficulties in implementing the coordination policy simply because (1) specified lot size adjustments may deviate from the economic lot sizes and (2) the buying firm may face amplified overstocking risks related to increased order quantities. The main objective of this study is to develop a quantity discount model that resolves the practical challenges associated with implementing quantity discount policies for supply chain coordination between a supplier and a buyer. The proposed Buyer’s Risk Adjustment (B-RA) model allows the supplier to offer discounts that capitalize on the original economic lot sizes and share the buyer’s risk of temporary overstocking under uncertain demand. The analytical results suggest that the proposed B-RA discount approach is a feasible alternative for supply chain coordination under uncertain demand conditions.     

Designing a quantity discount scheme for a newsvendor-type product with numerous heterogeneous retailers

This paper presents a practical approach for designing a quantity-discount (“qd”) scheme for a manufacturer who supplies a newsvendor-type product to a large number of heterogeneous retailers. The main components of our approach are: (i) an information structure for handling a large number of heterogeneous retailers with changing identities; and (ii) expected-profit expressions for any given qd scheme. We show that these expected-profit expressions can be easily optimized to produce attractive qd schemes; also, these schemes are shown to be quite robust against errors in parameter estimation.     

Optimal order size to take advantage of a one-time discount offer with allowed backorders

In this paper, we develop an inventory model for determining the optimal ordering policies for a buyer who operates an inventory policy based on an EOQ-type model with planned backorders when the supplier offers a temporary fixed-percentage discount and has specified a minimum quantity of additional units to purchase. A distinguishing feature of the model is that both fixed and linear backorder costs are included, whereas previous works include only the linear backordering cost. A numerical study is performed to provide insight into the behavior of the model.     

A dynamic quantity discount lot size model with resales

This paper deals with a dynamic lot size problem in which the unit purchasing price depends on the quantity of an order and resale of the excess is possible at the end of each period. We assume an all units discount system with a single price break point. Investigation of the properties of an optimal solution allows us to develop a dynamic programming algorithm. A problem example is solved to illustrate the algorithm.     

Analytical models for supplier selection and order quantity allocation

In the literature, decision models and techniques for supplier selection do not often consider inventory management of the items being purchased as part of the analysis. In this article, two mixed integer nonlinear programming models are proposed to select the best set of suppliers and determine the proper allocation of order quantities while minimizing the annual ordering, inventory holding, and purchasing costs under suppliers’ capacity and quality constraints. The first model allows independent order quantities for each supplier while the second model restricts all order quantities to be of equal size, as it would be required in a multi-stage (supply chain) inventory model. Illustrative examples are used to highlight the advantages of the proposed models over a previous model introduced in the literature.     

价格数量折扣下多阶段报童问题的在线策略

价格数量折扣可以提高订购量, 是库存决策中的一个重要因素. 特别地, 当订购量达到一定水平时, 价格折扣才会发生. 应用理论计算机科学兴起的弱集成算法, 研究具有这种价格数量折扣的多阶段报童问题的在线策略. 弱集成算法是一种在线序列决策算法, 其主要特点是不对未来输入做任何统计假设, 克服了报童问题研究中需要对需求做概率假设的困难. 主要将弱集成算法应用到固定订购量的专家策略, 给出了价格数量折扣下多阶段报童问题的具体在线策略;得到了该在线策略相对于最优专家策略的理论保证. 进一步将回收价值和缺货损失费引入, 给出了推广的在线策略及其理论结果. 最后应用数值算例说明了给出的在线策略具有较好的竞争性能.     

Profit maximization with quantity discount: An application of geometric programming

Profit maximization is an important issue to the firms that pursue the largest economic profit possible. Traditionally, profit maximization problem is solved by differentiating with respect to input prices. The total differentiation of the first-order conditions might give complicated equations difficult to handle. Different from traditional studies, this paper considers input quantity discount and employs geometric programming technique to derive the objective value for the profit-maximization problem. The geometric programming approach not only gives the global optimum solution but also provides the information that is able to discover the relationship between profit maximization and returns to scale in the solution process. No differentiation is required. Moreover, geometric programming can provide a computationally attractive view of sensitivity analysis for the changes in parameters. Examples are given to illustrate the idea proposed in this paper.     

Jointly pricing and ordering for a multi-product multi-constraint newsvendor problem with supplier quantity discounts

We present an extension to the multi-product newsvendor problem by incorporating the retailer’s pricing decision as well as considering supplier quantity discount. The objective is to maximize the expected profit of the retailer through jointly determining the ordering quantities and selling prices for the products, subject to multiple capacity constraints. We formulate the problem as a Generalized Disjunctive Programming (GDP) model and develop a Lagrangian heuristic approach for its solution. Randomly produced instances involving up to 1000 products are used to test the proposed approach. Computational results show that the Lagrangian heuristic approach can present very good solutions to all instances in reasonable time.     

Ensuring feasibility in ‘a generalized quantity discount pricing model to increase supplier's profits’

Lee and Rosenblatt examine ordering and quantity discount decisions for a single-vendor–single-buyer system from the perspective of the supplier. By imposing a constraint on the amount of price discount which may be offered to the purchaser they suggest a procedure for determining the optimal solution regarding the underlying planning problem. However, the proposed algorithm can end up with an infeasible solution. In this paper, we analyse the reason why this may happen and provide a fast computational procedure which simultaneously guarantees optimality and feasibility.     

The role of retailer’s performance in optimal wholesale price discount policies

The main goal of this paper is to model the effects of wholesale price control on manufacturer’s profit, taking explicitly into account the retailer’s sales motivation and performance. We consider a stylized distribution channel where a manufacturer sells a single kind of good to a single retailer. Wholesale price discounts are assumed to increase the retailer’s motivation thus improving sales. We study the manufacturer’s profit maximization problem as an optimal control model where the manufacturer’s control is the discount on wholesale price and retailer’s motivation is one of the state variables. In particular in the paper we prove that an increasing discount policy is optimal for the manufacturer when the retailer is not efficient while efficient retailers may require to decrease the trade discounts at the end of the selling period. Computational experiments point out how the discount on wholesale price passed by the retailer to the market (pass-through) influences the optimal profit of the manufacturer.     

An optimization approach for supply chain management models with quantity discount policy

Owing to the difficulty of treating nonlinear functions, many supply chain management (SCM) models assume that the average prices of materials, production, transportation, and inventory are constant. This assumption, however, is not practical. Vendors usually offer quantity discounts to encourage the buyers to order more, and the producer intends to discount the unit production cost if the amount of production is large. This study solves a nonlinear SCM model capable of treating various quantity discount functions simultaneously, including linear, single breakpoint, step, and multiple breakpoint functions. By utilizing the presented linearization techniques, such a nonlinear model is approximated to a linear mixed 0–1 program solvable to obtain a global optimum.     

A serial inventory system with supplier selection and order quantity allocation

Given the prevalence of both supplier selection and inventory control problems in supply chain management, this article addresses these problems simultaneously by developing a mathematical model for a serial system. This model determines an optimal inventory policy that coordinates the transfer of items between consecutive stages of the system while properly allocating orders to selected suppliers in stage 1. In addition, a lower bound on the minimum total cost per time unit is obtained and a 98% effective power-of-two (POT) inventory policy is derived for the system under consideration. This POT algorithm is advantageous since it is simple to compute and yields near optimal solutions.     

An integrated model for lot sizing with supplier selection and quantity discounts

Good inventory management is essential for a firm to be cost competitive and to acquire decent profit in the market, and how to achieve an outstanding inventory management has been a popular topic in both the academic field and in real practice for decades. As the production environment getting increasingly complex, various kinds of mathematical models have been developed, such as linear programming, nonlinear programming, mixed integer programming, geometric programming, gradient-based nonlinear programming and dynamic programming, to name a few. However, when the problem becomes NP-hard, heuristics tools may be necessary to solve the problem. In this paper, a mixed integer programming (MIP) model is constructed first to solve the lot-sizing problem with multiple suppliers, multiple periods and quantity discounts. An efficient Genetic Algorithm (GA) is proposed next to tackle the problem when it becomes too complicated. The objectives are to minimize total costs, where the costs include ordering cost, holding cost, purchase cost and transportation cost, under the requirement that no inventory shortage is allowed in the system, and to determine an appropriate inventory level for each planning period. The results demonstrate that the proposed GA model is an effective and accurate tool for determining the replenishment for a manufacturer for multi-periods.