The circumference of a sphere is measured to be 24 cm, with a possible error of 0.25 cm. Use the differential \(dV\) to estimate the maximum error in the calculated ...

A modified version of Generalized Programming is presented for solving convex programming problems. The procedure uses convenient linear approximations of the gradient of the dual in order to ...

Admission decisions for loss systems accessed by multiple customer classes are a classical queueing control problem with a wide variety of applications. When a server is available, the decision is ...

Abstract: An open-circuit voltage (OCV) model, which represents OCV as a function of state of charge (SOC), is essential for estimating the state of a battery. Typically, the OCV-SOC characteristic is ...

Rui Zhang, Saied Samiedaluie, and Dan Zhang. 2022. Product-based Approximate Linear Programs for Network Revenue Management. Operations Research, 70(5):2837-2850. The approximate linear programming ...

\(\ds dV=\frac{72}{\pi^2}\text{.}\) Observe that \(\ds dr=\frac{1}{8\pi}\text{.}\) Observe that \(\Delta A=A(s+\Delta s)-A(s)=2s\Delta s+(\Delta s)^2\) and \(dA=2s ...

We describe an algorithm, based on the simplex method of linear programming, for solving the discrete l 1 approximation problem with any type of linear constraints. The numerical results reported here ...

Abstract: To enable accurate and resource-efficient hardware implementation of fractional-order neural networks for neuromorphic computing, an optimized hardware architecture for field programmable ...