In this paper the real-world occurrence of the multiple-product multiple-constraint single period newsboy problem with two objectives, in which there is incremental discounts on the purchasing prices, is investigated. The constraints are the warehouse capacity and the batch forms of the order placements. The first objective of this problem is to find the order quantities such that the expected ...

To operate a multiple product manufacturing system under a CONWIP control policy, one must decide how to assign kanbans to products. With a fixed total number of kanbans in a competitive environment, the goal is to determine their allocation to product types in order to minimize lost sales equitably. In particular, we consider systems in which the products may make multiple visits to the same s...

We study the optimal (i.e. revenue maximizing) auction of multiple products. We make three major points. First, we extend the relationship between price discrimination and optimal auctions from the single-product case to the multiple-product case. A monopolist setting prices for multiple products may offer discounts on purchases of bundles of products; similarly, the optimal auction of multiple...

Software product line engineering aims to reduce development time, effort, cost and complexity by taking advantage of the commonality within a portfolio of similar products. The effectiveness of a software product line approach directly depends on how well feature variability within the portfolio is managed throughout the development lifecycle, from early analysis through maintenance and evolut...

   This paper presents a novel design of quaternary logic gates using graphene nanoribbon field effect transistors (GNRFETs). GNRFETs are the alternative devices for digital circuit design due to their superior carrier-transport properties and potential for large-scale processing. In addition, Multiple-valued logic (MVL) is a promising alternative to the conventional binary logic design. Sa...

The graphs studied in this paper are finite, undirected, without loops and multiple edges. A graph is called unretractive if it is isomorphic to each of its retracts. Unretractivity of graphs has been studied as a tool for generation and investigation of transformation groups. In particular the automorphism groups of graph products have been studied by Harary, Sabidussi, Hemminger, and Imrich a...

in this paper, we give a characterization of strongly jordan zero-product preserving maps on normed algebras as a generalization of  jordan zero-product preserving maps. in this direction, we give some illustrative examples to show that the notions of strongly zero-product preserving maps and strongly jordan zero-product preserving maps are completely different. also, we prove that the direct p...

let g be a simple connected graph. the generalized polarity wiener index ofg is defined as the number of unordered pairs of vertices of g whosedistance is k. some formulas are obtained for computing the generalizedpolarity wiener index of the cartesian product and the tensor product ofgraphs in this article.

This paper presents a multi-periodic, multi-echelon blood supply chain network consisting of blood donors, mobile collection units, local blood centers, main blood centers and demand points in which the local and main blood centers are subject to random failure in dispatching blood products to demand points. The problem has two objectives including minimization of the total chain costs and maxi...

We give an explicit formula for the shuffle relation in a general double shuffle framework that specializes to double shuffle relations of multiple zeta values and multiple polylogarithms. As an application, we generalize the well-known decomposition formula of Euler that expresses the product of two Riemann zeta values as a sum of double zeta values to a formula that expresses the product of t...