We present a primal–dual memory efficient algorithm for solving a relaxed version of the general transportation problem. Our approach approximates the original cost function with a differentiable one that is solved as a sequence of weighted quadratic transportation problems. The new formulation allows us to solve differentiable, non– convex transportation problems.

Joint economic lot sizing (JELS) addresses integrated inventory models in a supply chain. Most of the studies in this field either do not consider the role of the transportation cost in their analysis or consider transportation cost as a fixed part of the ordering costs. In this article, a model is developed to analyze an incremental quantity discount in transportation cost. Appropriate equatio...

Polyvinyl chloride supported silver molybdate composite material is used to develop by solution casting method. This membrane was characterized by various instrumental techniques such as Fourier transform infrared (FTIR) spectroscopy, thermogravimetric analysis (TGA) and scanning electron microscopy (SEM) analyses. These characterizations are used to understand the functional groups,thermal sta...

We study the question how many subgroups, cosets or subspaces are needed to cover a finite Abelian group or a vector space if we have some natural restrictions on the structure of the covering system. For example we determine, how many cosets we need, if we want to cover all but one element of an Abelian group. This result is a group theoretical extension of the theorem of Brouwer, Jamison and ...

The emergence of Intelligent Transportation Systems (ITS) has considerably changed the field of transportation modeling during the past ten years. By Intelligent Transportation Systems (ITS) we refer to transportation systems which apply emerging information technologies to alleviate congestion problems (see, for example, Transportation Research Board 1999). They combine advanced surveillance s...

In this paper, we introduce four inertial extragradient algorithms with non-monotonic step sizes to find the solution of convex feasibility problem, which consists a monotone variational inequality problem and fixed point demicontractive mapping. Strong convergence theorems suggested are established under some standard conditions. Finally, implement computational tests show efficiency advantage...