A Model for Integrated Inventory and Assortment Planning

Integrating inventory and assortment planning decisions is a challenging task that requires comparing the value of demand expansion through broader choice for consumers with the value of higher in-stock availability. We develop a stockout-based substitution model for trading off these values in a setting with inventory replenishment, a feature missing in the literature. Using the closed form solution for the single-product case, we develop an accurate approximation for the multiproduct case. This approximated formulation allows us to optimize inventory decisions by solving a fractional integer program with a fixed point equation constraint. When products have equal margins, we solve the integer program exactly by bisection over a one-dimensional parameter. In contrast, when products have different margins, we propose a fractional relaxation that we can also solve by bisection and that results in near-optimal solutions. Overall, our approach provides solutions within 0.1% of the optimal policy and finds the optimal solution in 80% of the random instances we generate. This paper was accepted by David Simchi-Levi, optimization.

Generalised Presic Type Operators in Modular Metric Space and an Application to Integral Equations of Caratheodory Type Functions

Extending the Presic type operators to modular spaces, we introduce generalised Presic type w -contractive mappings and strongly w -contractive mappings in a modular metric space and establish fixed-point theorems for such contractions in modular spaces. Ulam–Hyers stability of the fixed-point equation involving Presic type operators is also discussed. Our results extend and generalise some known results in the literature. The results are supported by appropriate example and an application to Caratheodory type integral equation.

About a fixed-point-type transformation to solve quadratic matrix equations using the Krasnoselskij method.

In this paper, we study the simplest quadratic matrix equation: $\mathcal{Q}(X)=X^2+BX+C=0$. We transform this equation into an equivalent fixed-point equation and based on it we construct the Krasnoselskij method. From this transformation, we can obtain iterative schemes more accurate than successive approximation method. Moreover, under suitable conditions, we establish different results for the existence and localization of a solution for this equation with the Krasnoselskij method. Finally, we see numerically that the predictor-corrector iterative scheme with the Krasnoselskij method as a predictor and the Newton method as corrector method, can improves the numerical application of the Newton method when approximating a solution of the quadratic matrix equation.

Variational-Like Inequality Problem Involving Generalized Cayley Operator

This article deals with the study of a variational-like inequality problem which involves the generalized Cayley operator. We compare our problem with a fixed point equation, and based on it we construct an iterative algorithm to obtain the solution of our problem. Convergence analysis as well as stability analysis are studied.

General fixed-point method for solving the linear complementarity problem

<abstract><p>In this paper, we consider numerical methods for the linear complementarity problem (LCP). By introducing a positive diagonal parameter matrix, the LCP is transformed into an equivalent fixed-point equation and the equivalence is proved. Based on such equation, the general fixed-point (GFP) method with two cases are proposed and analyzed when the system matrix is a $ P $-matrix. In addition, we provide several concrete sufficient conditions for the proposed method when the system matrix is a symmetric positive definite matrix or an $ H_{+} $-matrix. Meanwhile, we discuss the optimal case for the proposed method. The numerical experiments show that the GFP method is effective and practical.</p></abstract>

Modified SOR-Like Method for Absolute Value Equations

In this paper, based on the work of Ke and Ma, a modified SOR-like method is presented to solve the absolute value equations (AVE), which is gained by equivalently expressing the implicit fixed-point equation form of the AVE as a two-by-two block nonlinear equation. Under certain conditions, the convergence conditions for the modified SOR-like method are presented. The computational efficiency of the modified SOR-like method is better than that of the SOR-like method by some numerical experiments.

Single-seed cascades on clustered networks

We consider a dynamic network cascade process developed by Duncan Watts applied to a class of random networks, developed independently by Newman and Miller, which allows a specified amount of clustering (short loops). We adapt existing methods for locally tree-like networks to formulate an appropriate two-type branching process to describe the spread of a cascade started with a single active node and obtain a fixed-point equation to implicitly express the extinction probability of such a cascade. In so doing, we also recover a formula that has appeared in various forms in works by Hackett et al. and Miller which provides a threshold condition for certain extinction of the cascade. We find that clustering impedes cascade propagation for networks of low average degree by reducing the connectivity of the network, but for networks with high average degree, the presence of small cycles makes cascades more likely.

Generalized SOR-Like Iteration Method for Linear Complementarity Problem

In this paper, we present a generalized SOR-like iteration method to solve the non-Hermitian positive definite linear complementarity problem (LCP), which is obtained by reformulating equivalently the implicit fixed-point equation of the LCP as a two-by-two block nonlinear equation. The convergence properties of the generalized SOR-like iteration method are discussed under certain conditions. Numerical experiments show that the generalized SOR-like method is efficient, compared with the SOR-like method and the modulus-based SOR method.

Bifurcation Analysis of the γ-Ricker Population Model Using the Lambert W Function

In this work, we present the dynamical study and the bifurcation structures of the [Formula: see text]-Ricker population model. Resorting to the Lambert [Formula: see text] function, the analytical solutions of the positive fixed point equation for the [Formula: see text]-Ricker population model are explicitly presented and conditions for the existence and stability of these fixed points are established. The main focus of this work is the definition and characterization of the Allee effect bifurcation for the [Formula: see text]-Ricker population model, which is not a pitchfork bifurcation. Consequently, we prove that the phenomenon of Allee effect for the [Formula: see text]-Ricker population model is associated with the asymptotic behavior of the Lambert [Formula: see text] function in a neighborhood of zero. The theoretical results describe the global and local bifurcations of the [Formula: see text]-Ricker population model, using the Lambert [Formula: see text] function in the presence and absence of the Allee effect. The Allee effect, snapback repeller and big bang bifurcations are investigated in the parameters space considered. Numerical studies are included.