This paper looks at a Multi-Period Renewal equipment problem (MPR). It is inspired by a specific real-life situation where a set of hardware items is to be managed and their replacement dates determined, given a budget over a time horizon comprising a set of periods. The particular characteristic of this problem is the possibility of carrying forward any unused budget from one period to the nex...

Abstract: We develop a model to analyze optimal product-costing and pricing decisions in a dynamic information environment under long-term-capacity commitment. The arrival of new information about demand and cost parameters each period makes the problem complex. The optimal prices and capacity choices in our model cannot be decoupled as in Banker and Hughes’ (1994) single-period model. The opti...

This paper would firstly introduce the Single-Period Inventory Model, a basic method of inventory control. By analyzing Newsvendor Problem which is simplified situation storing inventories, this discover using normal distribution analysis to solve problem. Then, promote adoption into realistic problems and discuss its utility. Secondly, topic expanded Multi-Period System. system focus on more s...

abstract.   the sturm-liouville boundary value problem of the multi-order fractional differential equation  is studied. results on the existence of solutions are established. the analysis relies on a weighted function space and a fixed point theorem. an example is given to illustrate the efficiency of the main theorems.

Given a directed network, the uncapacitated fixed-charge network flow problem is to find a minimum-cost arc combination that provides flows from the supply nodes to the demand nodes. Associated with all arcs are two costs: the fixed charge of using the arc and the variable cost depending on the amount of flow the arc actually carries. This generic model has applications for problems of distribu...

This paper presents a branching method for the solution of the fixed charge transportation problem. Starting with a linear formulation of the problem, we develop the method which converges to the optimal solution. The method is based on the computation of a lower bound and an upper bound embedded within a branching process. We present a detailed numerical example to illustrate the proposed meth...

We formulate the fixed-charge multiple knapsack problem (FCMKP) as an extension of the multiple knapsack problem (MKP). The Lagrangian relaxation problem is easily solved, and together with a greedy heuristic we obtain a pair of upper and lower bounds quickly. We make use of these bounds in the pegging test to reduce the problem size. We also present a branch-and-bound (B&B) algorithm to solve ...

The Fixed Charge Transportation Problem (FCTP) is a generalization of the well-known Transportation Problem, where the cost for sending goods from origins to destinations is composed of a fixed cost and a continuous cost proportional to the amount of goods sent. In practical applications, the fixed costs may represent toll charges on highways, landing fees at airports, setup costs in production...

We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameters, (generating a Minimum Spanning Tree problem instance), to the variable costs, (generating a Shortest Paths problem instance). Thus we provide insight into the behavior of the problem, which is NP-hard and requires s...