We study sparsity on a statistical simplex consisting of all categorical distributions. This is different from the case in < because such a simplex is a Riemannian manifold, a curved space. A learner with sparse constraints would be likely to fall into its low-dimensional boundaries. We present a novel analysis on the statistical simplex as a manifold with boundary. We investigate the learning ...

multilayer bach propagation neural networks have been considered by researchers. despite their outstanding success in managing contact between input and output, they have had several drawbacks. for example the time needed for the training of these neural networks is long, and some times not to be teachable. the reason for this long time of teaching is due to the selection unsuitable network par...

Faults in computer networks may result in millions of dollars in cost. Faults in a network need to be localized and repaired to keep the health of the network. Fault management systems are used to keep today’s complex networks running without significant cost, either by using active techniques or passive techniques. In this paper, we propose a novel approach based on imperialist competitive alg...

Logistic network design is one of the most important strategic decisions in supply chain management that has recently attracted the attention of many researchers. Transportation network design is then one of the most important fields of logistic network. This study is concerned with designing a multi-stage and multi-product logistic network. At first, a mixed integer nonlinear programming model...

An active area of research for linear programming is to construct initial Simplex tableau that is close to the optimal solution, and to improve its pivoting selection strategies efficiently. In this paper, we present a new approach to the problem of initialization and pivoting rules: the algorithm is free from any artificial variables and artificial constraints, known as the big-M methods. By s...

GRADIENT ION CHROMATOGRAPHY WAS USED FOR THE SEPARATION OF EIGHT SUGARS: arabitol, cellobiose, fructose, fucose, lactulose, melibiose, N-acetyl-D-glucosamine, and raffinose. The separation method was optimized using a combination of simplex or genetic algorithm with the isocratic-to-gradient retention modeling. Both the simplex and genetic algorithms provided well separated chromatograms in a s...

This paper deals with the roundingerror analysis of the simplex method for solving linear-programming problems. We prove that in general any simplex-type algorithm is not well behaved, which means that the computed solution cannot be considered as an exact solution to a slightly perturbed problem. We also point out that simplex algorithms with well-behaved updating techniques (such as the Barte...

We investigate the problem of finding the first basic solution in the simplex algorithm. A modification of two phases simplex method is presented and its implementation in programming language Visual Basic is described. A few Netlib examples are presented.

In this paper, a scheduling problem for Automated Guided Vehicles in container terminals is defined and formulated as a Minimum Cost Flow model. This problem is then solved by a novel algorithm, NSA+, which extended the standard Network Simplex Algorithm (NSA). Like NSA, NSA+ is a complete algorithm, which means it guarantees optimality of the solution if it finds one within the time available....

This paper presents efficient implementations of several algorithms for solving the minimum-cost network flow problem. Various practical heuristics and other important implementation aspects are also discussed. A novel result of this work is the application of Goldberg’s recent partial augment-relabel method in the cost-scaling algorithm. The presented implementations are available as part of t...