A minimal sufficient condition for global optimality involving the Darboux point, analogous to the minimal sufficient condition of local optimality involving the conjugate point, is presented. The Darboux point is then characterized for optimal control problems with linear dynamics, cost functionals with a general terminal state term and an integrand quadratic in the state and control, and gene...

In this paper we design, characterize in closed-form, and evaluate a new index rule for Markovian time-varying channels, which gives rise to a simple opportunistic scheduling rule for flow-level scheduling in wireless downlink systems. For user channels we employ the Gilbert-Elliot model with a flow-level interpretation: the channel condition follows a general two-state Markov chain with distin...

We consider the assortment optimization problem under the classical two-level nested logit model. We establish a necessary and sufficient condition for the optimal assortment, and use this optimality condition to develop a simple greedy algorithm that iteratively removes at most one product from each nest, until the optimality condition is satisfied. Our algorithm also exploits the beautiful “l...

In this paper we consider the computation of channel capacity for ergodic multiple-input multiple-output channels with additive white Gaussian noise. Two scenarios are considered. Firstly, a time-varying channel is considered in which both the transmitter and the receiver have knowledge of the channel realization. The optimal transmission strategy is water-filling over space and time. It is sho...

The R package ALTopt has been developed with the aim of creating and evaluating optimal experimental designs of censored accelerated life tests (ALTs). This package takes the generalized linear model approach to ALT planning, because this approach can easily handle censoring plans and derive information matrices for evaluating designs. Three types of optimality criteria are considered: D-optima...

We study periodic-review inventory replenishment problems with fixed ordering costs, and show the optimality of (s, S) inventory replenishment policies. Inventory replenishment is instantaneous, i.e., the lead time is zero. We consider several sales mechanisms, e.g., auction mechanisms, name-your-own-price mechanisms, and multiple heterogeneous sales channels. We prove this result by showing th...

In recent years, there has been an increasing interest in studying the develpoment of optimality conditions for nondifferentiable multiobjective programming problems. Many authors established and employed some different Kuhn and Tucker type necessary conditions or other type necessary conditions to research optimal solutions; see [1–27] and references therein. In [7], Lai and Ho used the Pareto...

We study periodic-review inventory replenishment problems with fixed ordering costs, and show the optimality of (s, S) inventory replenishment policies. We consider several sales mechanisms, e.g., auction mechanisms, name-your-own-price mechanisms, and multiple heterogeneous sales channels. We prove this result by showing that these models satisfy a condition given by Huh and Janakiraman (2004)...

this paper provides an optimality-theoretic account of dissimilation in standard persian as well as some other accents and dialects of persian. as such, this work starts by introducing optimality theory (henceforth ot) and its basic concepts and then it investigates dissimilation in this framework. it argues for the superiority of ot over derivational approaches regarding a case in which both d...