The reliability of an element with alternating failure rate
The Reliability of Systems With Stair-Type Consecutive Minimal Cuts
The risk-sensitive Poisson equation for a communicating Markov chain on a denumerable state space
This work concerns a discrete-time Markov chain with time-invariant transition mechanism and denumerable state space, which is endowed with a nonnegative cost function with finite support. The performance of the chain is measured by the (long-run) risk-sensitive average cost and, assuming that the state space is communicating, the existence of a solution to the risk-sensitive Poisson equation is established, a result that holds even for transient chains. Also, a sufficient criterion ensuring that...
The second order optimality conditions for nonlinear mathematical programming with data
To find nonlinear minimization problems are considered and standard -regularity assumptions on the criterion function and constrained functions are reduced to -regularity. With the aid of the generalized second order directional derivative for real-valued functions, a new second order necessary optimality condition and a new second order sufficient optimality condition for these problems are derived.
The set covering problem : a group theoretic approach
The shrinking projection method for solving variational inequality problems and fixed point problems in Banach spaces.
The single (and multi) item profit maximizing capacitated lot–size (PCLSP) problem with fixed prices and no set–up
This paper proposes a specialized LP-algorithm for a sub problem arising in simple Profit maximising Lot-sizing. The setting involves a single (and multi) item production system with negligible set-up costs/times and limited production capacity. The producer faces a monopolistic market with given time-varying linear demand curves.
The single server queue and the storage model: large deviations and fixed points.
The single server queue with Erlang input and semi-Markov service times
The solution of some max-separable optimization problems [Abstract of thesis]
The stability radius of an efficient solution in minimax Boolean programming problem
The stationary G/G/ queue.
The stationary G/G/ queue with non-identical servers.
The stationary local sojourn time in single server tandem queues with renewal input.
The steepest descent dynamical system with control. Applications to constrained minimization
Let be a real Hilbert space, a convex function of class that we wish to minimize under the convex constraint . A classical approach consists in following the trajectories of the generalized steepest descent system (cf. Brézis [5]) applied to the non-smooth function . Following Antipin [1], it is also possible to use a continuous gradient-projection system. We propose here an alternative method as follows: given a smooth convex function whose critical points coincide with and a control...
The steepest descent dynamical system with control. Applications to constrained minimization
Let H be a real Hilbert space, a convex function of class that we wish to minimize under the convex constraint S. A classical approach consists in following the trajectories of the generalized steepest descent system (cf. Brézis [CITE]) applied to the non-smooth function . Following Antipin [1], it is also possible to use a continuous gradient-projection system. We propose here an alternative method as follows: given a smooth convex function whose critical points coincide with S and...
The steepest-ascent method for the linear programming problem
The system of generalized set-valued equilibrium problems.
The techniques of linear multiobjective programming
The theory of networks of single server queues and the tandem queue model.