We study a perishable inventory system that requires to maintain a minimum inventory volume at all times, where the minimum amount in the constraint is significant with respect to regular market demand and the traditional Economic Manufacturing Quantity (EMQ) models do not suffice. The problem is motivated by applications in homeland security, which are related to the management of pharmaceutic...

In this paper we specify the conditions on the parameters of pairs of gOS’s under which the corresponding generalized order statistics are ordered according to usual stochastic ordering, hazard rate ordering, likelihood ratio ordering and dispersive ordering. We consider this problem in one-sample as well as two-sample problems. We show that some of the results obtained by Franco et al. ...

in this paper, we study the problem of minimizing the ratio of two quadratic functions subject to a quadratic constraint. first we introduce a parametric equivalent of the problem. then a bisection and a generalized newton-based method algorithms are presented to solve it. in order to solve the quadratically constrained quadratic minimization problem within both algorithms, a semidefinite optim...

The join ordering problem is a fundamental challenge that has to be solved by any query optimizer. Since the high-performance RDF systems are often implemented as triple stores (i.e., they represent RDF data as a single table with three attributes, at least conceptually), the query optimization strategies employed by such systems are often adopted from relational query optimization. In this pap...

In this paper, a new fuzzy multi-criteria mathematical model for the selection of the best among a finite number of ordering policy of raw material in a supply chain is developed. The problem treated is a part of the purchasing plan of a company in an uncertain environment and it is very common in business practice. Optimization criteria selected describe the performance measures of ordering po...

The minimum cost homomorphism problem has arisen as a natural and useful optimization problem in the study of graph (and digraph) coloring and homomorphisms: it unifies a number of other well studied optimization problems. It was shown by Gutin, Rafiey, and Yeo that the minimum cost problem for homomorphisms to a digraph H that admits a so-called extended MinMax ordering is polynomial time solv...

In consideration of the previous workshop, we participate in TSC-3 to make improvements on important sentence extraction used in dry run of TSC-2. We formulate important sentence extraction as a combinational optimization problem that determines a set of sentences containing as many important information fragments as possible. In addition to the extraction method, we reinforce peripheral compon...

A key issue for high integration circuit design in the semiconductor industry are power constraints that stem from the need for heat removal and reliability or battery lifetime limitations. As the power consumption depends heavily on the capacitances between adjacent wires, determining the optimal ordering and spacing of parallel wires is an important issue in the design of low power chips. As ...

Automated termination provers often use the following schema to prove that a program terminates: construct a relational abstraction of the program’s transition relation and then show that the relational abstraction is wellfounded. The focus of current tools has been on developing sophisticated techniques for constructing the abstractions while relying on known decidable logics (such as linear a...