In a capacitated multi-item dynamic pricing problem one maximizes the profit by choosing a proper production level as well as pricing policy, where the latter depends on a satisfied demand. The objective function involves inventory, production and setup costs, and revenue functions. The products are required to satisfy joined production capacities. We consider a bilinear reduction of the linear...

In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger’s critical-pair/completion algorithm for computing Gröbner bases in reduction rings. We describe how the algorithm can be implemented and verified within one single software system, which in our case is the Theorema system. In contrast to existing formal correctness proofs of Buchbe...

Computer algebra systems often produce large expressions involving complicated algebraic numbers. In this paper we study variations of the polred algorithm that can often be used to find better representations for algebraic numbers. The main new algorithm presented here is an algorithm that treats the same problem for the function field case.

this paper presents a new hybrid particle swarm optimization with time varying acceleration coefficients (hpsotvac) and bacteria foraging algorithm (bfa) namely (psotvac/bfa) base fuzzy stochastic long term approach for determining optimum location and size of distributed energy resources (ders). the monte carlo simulation method is used to model the uncertainties associated with long-term load...

In this paper, a mixed-integer linear programming model is proposed to integrate batch picking and distribution scheduling problems in order to optimize them simultaneously in an order picking warehouse. A tow-phase heuristic algorithm is presented to solve it in reasonable time. The first phase uses a genetic algorithm to evaluate and select permutations of the given set of customers. The seco...

We consider the complexity of a Lenstra Lenstra Lovász lattice reduction algorithm ([LLL]) in which the vectors are allowed to be linearly dependent and in which one also asks for the matrix of the transformation from the given generators to the reduced basis. The main problem will be to show that the entries of the transformation matrix remain bounded through the algorithm, with a reasonable b...

Faigle, U. and R. Schrader, A greedy reduction algorithm for setup optimization, Discrete Applied Mathematics 35 (1992) 73-79. A reduction algorithm for setup optimization in general ordered sets is proposed. Moreover, the class of weakly cycle-free or.iers is introduced. All orders in this class are Dilworth optimal. Cycle-free orders and bipartite Dilworth optimal orders are proper subclasses...

Dimensionality reduction algorithms are extremely useful in various disciplines, especially related to data processing in high dimensional spaces. However, most algorithms proposed in the literature assume total knowledge of data usually residing in a centralized location. While this still suffices for several applications, there is an increasing need for management of vast data collections in ...

Power consumption of digital systems has become a critical design parameter. An important class of digital systems includes applications such as video image processing and speech recognition, which are extremely memory dominant. In such systems, a significant amount of power is consumed during memory accesses. Reducing the number of memory accesses can considerably impact the power dissipation ...

Many problems in modern interconnect and packaging design require use of ‘full-wave’ modeling in order to get a good accuracy at high frequencies. In this paper we will introduce passive Arnoldy based model order reduction algorithm for such systems.