In this study, tactical decisions considering the material and financial flows in a supply chain have been made. To achieve these aims and some effective solutions, a multi-objective mathematical model proposed for an integrated supply chain master planning problem. The multi-product, multi-period and capacitated supply chain network has three objective functions. Two first objective functions ...

We analyze degeneracy characterizations for two classical problems: the transportation paradox in linear transportation problems and the pure constant fixed charge transportation problem. Solving the pure constant fixed charge problem is equivalent to finding a basic tree solution with maximum degree of degeneracy. Problems possess degenerate solutions if the equal subsum property is satisfied ...

The multi-item single level capacitated dynamic lot-sizing problem consists of scheduling N items over a horizon of T periods. The objective is to minimize the sum of setup and inventory holding costs over the horizon subject to a constraint on total capacity in each period. No backlogging is allowed. Only one machine is available with a fixed capacity in each period. In case of a single item p...

this paper introduces an implicit scheme for a   continuous representation of nonexpansive mappings on a closed convex subset of a hilbert space with respect to a   sequence of invariant means defined on an appropriate space of bounded, continuous real valued functions of the semigroup.   the main result is to    prove the strong convergence of the proposed implicit scheme to the unique solutio...

This technical note addresses the distributed fixed-time consensus protocol design problem for multi-agent systems with general linear dynamics over directed communication graphs. By using motion planning approaches, a class of distributed fixed-time consensus algorithms are developed, which rely only on the sampling information at some sampling instants. For linear multi-agent systems, the pro...

In this paper we study the Pareto-optimal solutions in convex multi-objective optimization with compact and convex feasible domain. One of the most important problems in multi-objective optimization is the investigation of the topological structure of the Pareto sets. We present the problem of construction of a retraction function of the feasible domain onto Paretooptimal set, if the objective ...

The article processing charge (APC) is currently the primary method of funding professionally published Open Access peer reviewed journals. The pricing principles of 77 OA publishers publishing over 1000 journals using APCs were studied and classified. The most commonly used pricing method is a single fixed fee, which can either be the same for all of a publisher’s journals or individually dete...

We present a branch-and-cut algorithm to solve the single commodity uncapacitated fixed charge network flow problem, which includes the Steiner tree problem, uncapacitated lot-sizing problems, and the fixed charge transportation problem as special cases. The cuts used are simple dicut inequalities and their variants. A crucial problem when separating these inequalities is to find the right cut ...