## Search

Now showing items 1-10 of 19

#### A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications

(Elsevier, 2000-07-01)

In this paper a simple derivation of duality is presented for convex quadratic programs with a convex quadratic
constraint. This problem arises in a number of applications including trust region subproblems of nonlinear ...

#### An exact approach to minimizing total weighted tardiness with release dates

(Kluwer Academic Publishers, 2000)

The study deals with scheduling a set of independent jobs with unequal release dates to minimize total weighted tardiness on a single machine. We propose new dominance properties that are incorporated in a branch and bound ...

#### Characteristic of exit moments and models of enlargement of states for finite Markov chains in terms of global memory functionals

(Springer, 2000)

A notion of local- and global-memory functions for discrete-type distributions is introduced by analogy with the notion of the memory for continuous-type distributions introduced in Muth's papers. In the class of ...

#### Analysis of reactive scheduling problems in a job shop environment

(Elsevier, 2000)

In this paper, we study the reactive scheduling problems in a stochastic manufacturing environment. Specifically, we test the several scheduling policies under machine breakdowns in a classical job shop system. In addition, ...

#### The asymptotic properties of estimates of the parameters of nonlinear time series

(Springer, 2000)

Asymptotic properties of nonlinear time series parameter estimators constructed on trajectories of stochastic systems under stationary and transient conditions are studied with the use of the least-squares method. The ...

#### Z-theorems: Limits of stochastic equations

(International Statistical Institute, 2000)

Let fn(è, ù) be a sequence of stochastic processes which converge weakly to a limit process f 0(è, ù). We show under some assumptions the weak inclusion of the solution sets èn(ù) fè : fn(è, ù) 0g in the limiting ...

#### Boolean normal forms, shellability, and reliability computations

(Society for Industrial and Applied Mathematics, 2000)

Orthogonal forms of positive Boolean functions play an important role in reliability theory, since the probability that they take value 1 can be easily computed. However, few classes of disjunctive normal forms are known ...

#### On the single-assignment p-hub center problem

(Elsevier, 2000)

We study the computational aspects of the single-assignment p-hub center problem on the basis of a basic model and a new model. The new model's performance is substantially better in CPU time than different linearizations ...

#### Input data analysis using neural networks

(Sage Publications, 2000)

Simulation deals with real-life phenomena by constructing representative models of a system being questioned. Input data provide a driving force for such models. The requirement for identifying the underlying distributions ...

#### Bounds on the opportunity cost of neglecting reoptimization in mathematical programming

(INFORMS, 2000)

Postoptimality or sensitivity analysis are well-developed subjects in almost all branches of mathematical programming. In this note, we propose a simple formula which can be used to get preliminary bounds on the value of ...