It is of interest in various contexts to find approximate feasible points to problems that have equality, inequality and bound constraints. For example, in exhaustive search algorithms for global optimization, it is of interest to construct bounds around approximate feasible points, within which a true feasible point is proven to exist. In such exhaustive search algorithms, the approximate feas...

In this paper, we introduce the truncated primal-infeasible dual-feasible interior point algorithm for linear programming and describe an implementation of this algorithm for solving the minimum cost network flow problem. In each iteration, the linear system that determines the search direction is computed inexactly, and the norm of the resulting residual vector is used in the stopping criteria...

One of the steps in the Arbitrary Lagrangian Eulerian (ALE) algorithm is the improvement of the quality of the computational mesh. This step, commonly referred to as rezoning, is essential for maintaining a mesh that does not become invalid during a simulation. In this paper, we present a new robust and computationally efficient 2D mesh relaxation method. This feasible set method is a geometric...

there are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. the first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. t...

In this paper, by means of the concept of the working set, which is an estimate of the active set, we propose a feasible sequential linear equation algorithm for solving inequality constrained optimization problems. At each iteration of the proposed algorithm, we first solve one system of linear equations with a coefficient matrix of size m × m (where m is the number of constraints) to compute ...

BACKGROUND In malrotation the position of third portion of duodenum (D3) is always intramesenteric. Demonstration of normal retromesenteric-retroperitoneal position of D3 on ultrasound (US) can rule out malrotation. The aim of this study was to evaluate the feasibility of US in demonstrating the retroperitoneal D3. MATERIAL/METHODS Abdominal US study was done for various indications in 60 new...

A metadata search approach is proposed to provide practical solutions to the natural language database query problem; where the metadata grow in largely linear manner and the search is linguistics-free. A new class of reference dictionary integrates four types of enterprise metadata: enterprise information models, database values, user-words, and query cases. The layered and scalable informatio...