We present a generalization of the average shadow price in 0-1-Mixed Integer Linear Programming problems and its relation with bottlenecks including the analysis relative to the coefficients matrix of resource constraints. A mathematical programming approach to find the strategy for investment in resources is presented. KeywordsMixed Integer programming, Average shadow price, Bottlenecks, Resou...

The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-...

A mixed 0-1 integer programming model of Combined Location Routing and Inventory Problem (CLRIP) with fuzzy random demand has been proposed in B2C E-commerce distribution environment. Demands of customers and distribution centers have been assumed to be fuzzy random variables.

‎in this paper‎, ‎some kkt type sufficient global optimality conditions‎ ‎for general mixed integer nonlinear programming problems with‎ ‎equality and inequality constraints (minpp) are established‎. ‎we achieve‎ ‎this by employing a lagrange function for minpp‎. ‎in addition‎, ‎verifiable sufficient global optimality conditions for general mixed‎ ‎integer quadratic programming problems are der...

This paper investigates a multi-period rectilinear distance 1-center location problem considering a line-shaped barrier, in which the starting point of the barrier follows the uniform distribution function. In addition, the existing points are sensitive to demands and locations. The purpose of the presented model is to minimize the maximum barrier distance from the new facility to the existing ...

A mixed hypergraph H = (X, C,D) consists of the vertex set X and two families of subsets: the family C of C-edges and the family D of D-edges. In a coloring, every C-edge has at least two vertices of common color, while every D-edge has at least two vertices of different colors. The largest (smallest) number of colors for which a coloring of a mixed hypergraph H using all the colors exists is c...

Determination of shipment quantity and distribution problem is an important subject in today’s business. This paper describes the inventory/distribution network design. The system addresses a class of distribution network design problem, which is characterized by multiple products family, multiple warehouses and retail-ers. The maximum capacity of vehicles and warehouses are also known. The res...

Robust supplier selection problem, in a scenario-based approach has been proposed, when the demand and exchange rates are subject to uncertainties. First, a deterministic multi-objective mixed integer linear programming is developed; then, the robust counterpart of the proposed mixed integer linear programming is presented using the recent extension in robust optimization theory. We discuss dec...

The Feasibility Pump (fp) is probably the best known primal heuristic for mixed integer programming. The original work by Fischetti, Glover, and Lodi [24], which introduced the heuristic for 0-1 mixed-integer linear programs, has been succeeded by more than twenty follow-up publications which improve the performance of the fp and extend it to other problem classes. Year 2015 was the tenth anniv...