We consider the processor sharing M/M/1-PS queue which also models balking. A customer that arrives and sees n others in the system “balks” (i.e., decides not to enter) with probability 1−b <Subscript> n </Subscript>. If b <Subscript> n </Subscript> is inversely proportional to n + 1, we obtain explicit expressions for a tagged...</subscript></subscript>

In a market with partial information we consider the optimal selection of portfolios for utility maximizing investors under joint budget and shortfall risk constraints. The shortfall risk is measured in terms of expected loss. Stock returns satisfy a stochastic differential equation. Under...

In this paper, we consider optimization problems under probabilistic constraints which are defined by two-sided inequalities for the underlying normally distributed random vector. As a main step for an algorithmic solution of such problems, we prove a derivative formula for (normal)...

The problem of minimizing <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${\tilde f=f+p}$$</EquationSource> </InlineEquation> over some convex subset of a Euclidean space is investigated, where f(x) = x <Superscript> T </Superscript> Ax + b <Superscript> T </Superscript> x is strictly convex and |p| is only assumed to be bounded by some positive number s. It is shown that the function <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$${\tilde f}$$</EquationSource> </InlineEquation> is strictly outer...</equationsource></inlineequation></superscript></superscript></equationsource></inlineequation>

We consider an inverse quadratic programming (QP) problem in which the parameters in both the objective function and the constraint set of a given QP problem need to be adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a linear...

For determining an optimal portfolio allocation, parameters representing the underlying market—characterized by expected asset returns and the covariance matrix—are needed. Traditionally, these point estimates for the parameters are obtained from historical data samples, but as experts often...

For sequential decision processes with countable state spaces, we prove compactness of the set of strategic measures corresponding to nonrandomized policies. For the Borel state case, this set may not be compact (Piunovskiy, Optimal control of random sequences in problems with constraints....

This paper investigates generators’ strategic behaviors in contract signing in the forward market and power transaction in the electricity spot market. A stochastic equilibrium program with equilibrium constraints (SEPEC) model is proposed to characterize the interaction of generators’...

We consider the M/G/1 queue with a processor sharing server. We study the conditional sojourn time distribution, conditioned on the customer’s service requirement, as well as the unconditional distribution, in various asymptotic limits. These include large time and/or large service request,...

Given a simple, undirected graph G, Budinich (Discret Appl Math 127:535–543, 2003) proposed a lower bound on the clique number of G by combining the quadratic programming formulation of the clique number due to Motzkin and Straus (Can J Math 17:533–540, 1965) with the spectral decomposition...