Analyses de régression et programmation linéaire
Analyses of the Operational Performance of Maternal and Child Health (MCH) Services in Hong Kong
Analyses of the Solution to a Linear Fractional Functionals Programming .
Analysis of a bulk queue with unreliable server and single vacation.
Analysis of a -out-of- system with spares, repairs, and a probabilistic rule.
Analysis of a MX/G(a,b)/1 queueing system with vacation interruption
In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary job is interrupted abruptly and the server resumes for primary...
Analysis of a MX/G(a,b)/1 queueing system with vacation interruption
In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary...
Analysis of a near-metric TSP approximation algorithm
The traveling salesman problem (TSP) is one of the most fundamental optimization problems. We consider the β-metric traveling salesman problem (Δβ-TSP), i.e., the TSP restricted to graphs satisfying the β-triangle inequality c({v,w}) ≤ β(c({v,u}) + c({u,w})), for some cost function c and any three vertices u,v,w. The well-known path matching Christofides algorithm (PMCA) guarantees an approximation ratio of 3β2/2 and is the best known algorithm for the Δβ-TSP, for 1 ≤ β ≤ 2. We provide a complete...
Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming
The smoothing-type algorithm is a powerful tool for solving the second-order cone programming (SOCP), which is in general designed based on a monotone line search. In this paper, we propose a smoothing-type algorithm for solving the SOCP with a non-monotone line search. By using the theory of Euclidean Jordan algebras, we prove that the proposed algorithm is globally and locally quadratically convergent under suitable assumptions. The preliminary numerical results are also reported which indicate...
Analysis of a production system with a feedback buffer and a general dispatching time.
Analysis of a Two-Level Queuing Production System With Finite Dedicated Buffers
Analysis of a two-unit standby redundant system with three states of units
A cold-standby redundant system with two identical units and one repair facility is considered. Units can be in three states> good (I), degraded (II), and failed (III). We suppose that only the following state-transitions of a unit are possible: . The repair of a unit of the type can be interpreted as a preventive maintenance. Its realization depends on the states of both units. Several characteristics of the system (probabilities, distribution functions or their Laplace-Stieltjes transforms...
Analysis of an Integrated Production-Sales Problem for One-Machine, Two-Product System
Analysis of an isopetype dual algorithm for optimizing control and nonlinear optimization
First results concerning important theoretical properties of the dual ISOPE (Integrated System Optimization and Parameter Estimation) algorithm are presented. The algorithm applies to on-line set-point optimization in control structures with uncertainty in process models and disturbance estimates, as well as to difficult nonlinear constrained optimization problems. Properties of the conditioned (dualized) set of problem constraints are investigated, showing its structure and feasibility properties...
Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies
Hysteretic control of arrivals is one of the most easy-to-implement and effective solutions of overload problems occurring in SIP-servers. A mathematical model of an SIP server based on the queueing system with batch arrivals and two hysteretic loops is being analyzed. This paper proposes two analytical methods for studying performance characteristics related to the number of customers in the system. Two control policies defined by instants when it is decided to change the system’s mode are considered....
Analysis of AQM queues with queue size based packet dropping
Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical examples that...
Analysis of MAP/PH(1), PH(2)/2 queue with Bernoulli vacations.
Analysis of Markov chain algorithms on spanning trees, rooted forests, and connected subgraphs
We analyse a natural edge exchange Markov chain on the set of spanning trees of an undirected graph by the method of multicommodity flows. The analysis is then refined to obtain a canonical path analysis. The construction of the flow and of the canonical paths is based on related path constructions in a paper of Cordovil and Moreira (1993) on block matroids. The estimates of the congestion measure imply a polynomial bound on the mixing time. The canonical paths for spanning trees also yield polynomial...
Analysis of M-stationary points to an EPEC modeling oligopolistic competition in an electricity spot market
We consider an equilibrium problem with equilibrium constraints (EPEC) arising from the modeling of competition in an electricity spot market (under ISO regulation). For a characterization of equilibrium solutions, so-called M-stationarity conditions are derived. This first requires a structural analysis of the problem, e.g., verifying constraint qualifications. Second, the calmness property of a certain multifunction has to be verified in order to justify using M-stationarity conditions. Third,...
Analysis of M-stationary points to an EPEC modeling oligopolistic competition in an electricity spot market∗
We consider an equilibrium problem with equilibrium constraints (EPEC) arising from the modeling of competition in an electricity spot market (under ISO regulation). For a characterization of equilibrium solutions, so-called M-stationarity conditions are derived. This first requires a structural analysis of the problem, e.g., verifying constraint qualifications. Second, the calmness property of a certain multifunction has to be verified in order...