In this paper, we consider fuzzy inventory with backorder. First, we fuzzify the storing cost a, backorder cost b, cost of placing an order c, total demand r, order quantity q, and shortage quantity s as the triangular fuzzy numbers in the total cost. From these, we can obtain the fuzzy total cost. Using the signed distance method to defuzzify, we get the estimate of the total cost in the fuzzy...

We introduce and study a family of generalized double-layer potentials which are used to build smooth and accurate approximants for the signed distance function. Given a surface, the value of an approximant at a given point is a power mean of distances from the point to the surface points parameterized by the angle they are viewed from the given point. We analyze mathematical properties of the ...

This thesis is concerned with topics related to dense mapping of large scale three-dimensional spaces. In particular, the motivating scenario of this work is one in which a mobile robot with limited computational resources explores an unknown environment using a depth-camera. To this end, low-level topics such as sensor noise, map representation, interpolation, bit-rates, compression are invest...

For the total cost of the inventory without backorder model, if we fuzzify the order quantity, the total demand, the cost of storing and the cost of placing an order as fuzzy numbers then we can obtain the fuzzy total cost. In this paper, we apply the signed distance method to defuzzify the fuzzy total cost and then solve the optimal order quantity.

In this paper, we propose a numerical method for computing the signed distance function to a discrete domain, on an arbitrary triangular background mesh. It mainly relies on the use of some theoretical properties of the unsteady Eikonal equation. Then we present a way of adapting the mesh on which computations are held to enhance the accuracy for both the approximation of the signed distance fu...

We present a numerical method for computing the signed distance to a piecewise-smooth surface defined as the zero set of a function. It is based on a marching method by Kim [Kim01] and a hybrid discretization of firstand second-order discretizations of the signed distance function equation. If the solution is smooth at a point and at all of the points in the domain of dependence of that point, ...