Background: The diagnosis of herpes simplex virus may requirevirological confirmation. Tzanck smear is an old, rapid, costeffective but nonspecific method that has been recently re-evaluatedas a method for the diagnosis of herpes virus infection. This studywas conducted to compare Tzanck smear and viral culture in thediagnosis of herpes simplex virus infection in patients clinicallysuspected to...

To understand how simplex solves a general linear programming problem, we need to know the answers to a number of questions: • How to determine if a minimum feasible solution has been found? • Which basic variable should become non-basic at a pivot step? • Which nonbasic variable is to enter the basis at a pivot step? • How to find an initial basic feasible solution to start simplex? We already...

In case of a special problem class, the simplex method can be implemented as a cutting-plane method that approximates a polyhedral convex objective function. In this paper we consider a regularized version of this cutting-plane method, and interpret the resulting procedure as a regularized simplex method. (Regularization is performed in the dual space and only affects the process through the pr...

We consider a new interpretation of the modified simplex imbeddings method. The main construction of this method is a simplex which contains a solution of convex non-differentiable problem. A cutting plane drawn through the simplex center is used to delete a part of the simplex without the solution. The most interesting feature of this method is the convergence estimation which depends only on ...

The teaching experience of the revised simplex method in matrix notation on the blackboard leads us to prepare a visualization alternative, useful for the constituting part of the education liturgy. According to our approach the educator does not spend anymore valuable time on boring calculations while the student understands complex mathematical concepts. Our courseware has unique features lik...

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

The fuzzy primal simplex method [15] and the fuzzy dual simplex method [17] have been proposed to solve a kind of fuzzy linear programming (FLP) problems involving symmetric trapezoidal fuzzy numbers. The fuzzy simplex method starts with a primal fuzzy basic feasible solution (FBFS) for FLP problem and moves to an optimal basis by walking truth sequence of exception of the optimal basis obtaine...