We address the issue of Bernoulli/Geometric arrivals see time-averages, BASTA, in discrete-time queues when using a variety of scheduling rules. It is well-known that BASTA/ASTA holds in the framework of a discrete-time process with an imbedded ...

Consider a LCFS-PR M / G / 1 queue and assume that at time t = 0, there are n + 1 customers c 1 , c 2 , . . . , c n + 1 who arrived in that order. In addition, at time t = 0 there is an additional customer c with service requirement x > 0 who ...

We study classical and monotone mean-variance portfolio selection when asset prices are continuous under general trading constraints. Our main result is that optimal values and strategies for both objectives coincide in this setting. The only ...

We consider the number of overlapping customers in several single- and multiserver queues, i.e., the number of customers whose visit to a service system at some point in time has an overlap with that of a tagged customer. Restricting ourself to ...

We analyze restarted PDHG on totally unimodular linear programs. In particular, we show that restarted PDHG finds an ϵ-optimal solution in O ( H m 1 2.5 nnz ( A ) log ⁡ ( H m 2 / ϵ ) ) matrix-vector multiplies where m 1 is the number of ...

We consider the problem of packing a given number of congruent circles with the maximum radius in a unit square as a mathematical optimization problem. Due to the presence of non-overlapping constraints, this problem is a notoriously difficult ...

We consider the lost-sales inventory systems with stochastic lead times and establish the asymptotic optimality of base-stock policies for such systems. Specifically, we prove that as the per-unit lost-sales penalty cost becomes large compared to ...

A three-term Polak–Ribière–Polyak conjugate gradient-like method for bicriteria optimization without scalarization is proposed in this paper. Three advantages are to be noted. First, the descent directions are given explicitly and can then be ...

In recent years, the integration of Machine Learning (ML) models with Operation Research (OR) tools has gained popularity in applications such as cancer treatment, algorithmic configuration, and chemical process optimization. This integration ...

This paper introduces the Traveling Salesman Problem (TSP) with Backend Information Processing (bTSP), which integrates backend processing times into path planning to minimize the makespan. The study develops a mixed integer linear programming ...

We generalize Zhang and Xu's (2011) [22] interior point algorithm for linear optimization to semidefinite optimization problems in order to define a new search direction. The symmetrization of the search direction is based on the full Nesterov-...

In this note, based on the recent remarkable results of Dufour and Prieto-Rumeau, we deduce that for an absorbing Markov decision process with a given initial state, under a standard compactness-continuity condition, the space of occupation ...

This research delves into the Shannon differential entropy properties of consecutive k-out-of-n:G. Initially, an expression for the entropy of the lifetime of a consecutive k-out-of-n:G system is formulated, providing a comprehensive ...

Using the option delta systematically, we derive tighter lower and upper bounds of the Black–Scholes implied volatility than those in Tehranchi (2016) [11]. As an application, we propose a Newton–Raphson algorithm on the log price that converges ...

This note studies monotone Markov chains, a subclass of Markov chains with extensive applications in operations research and economics. While the properties that ensure the global stability of these chains are well studied, their establishment ...

This paper deals with a risk probability minimization problem for finite horizon partially observable semi-Markov decision processes, which are the fairly most general models for stochastic dynamic systems. In contrast to the expected discounted ...

In the minimum eigenvalue problem, we are given a collection of vectors in R d, and the goal is to pick a subset B to maximize the minimum eigenvalue of the matrix ∑ i ∈ B v i v i ⊤. We give a O ( n O ( d log ⁡ ( d ) / ϵ 2 ) )-time randomized ...

DSatur is a widely-used heuristic algorithm for graph coloring, proposed by Daniel Brélaz in 1979. It is based on the greedy coloring approach, but selecting the next vertex to be colored from those that maximize the number of colors already used ...

A phase-type distributed random variable represents the time to absorption of a Markov chain with an absorbing state. In this letter, we show that the alias method can be modified to efficiently generate phase-type distributed random variables. ...

Let C ⊂ R n be convex, compact, with nonempty interior and h be Legendre with domain C, continuous on C. We prove that h is Bregman if and only if it is strictly convex on C and C is a polytope. This provides insights on sequential convergence of ...