In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by the Network Simplex Algorithm (NSA). The algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

Ships play the major role in bulk transportation and they need their special energy system. This paper proposes a stochastic programing method for optimal sizing of a hybrid ship power system with energy storage system (ESS), photovoltaic power (PV) and diesel generator. To account for uncertainties, in this study a two-stage stochastic mixed-integer non-linear programing is used to model the o...

In the real word, there are many problems which have linear programming models and sometimes it is necessary to formulate these models with parameters of uncertainty. Many numbers from these problems are linear programming problems with fuzzy variables. Some authors considered these problems and have developed various methods for solving these problems. Recently, Mahdavi-Amiri and Nasseri (2007...

We report tests of CPLP, a piecewise-linear simplex implementation based on the XMP subroutine library. Using test problems of various shapes and origins, we judge CPLP against a comparable linear bounded-variable simplex code that is applied to equivalent linear programs. Our evidence indicates that CPLP is typically 2 to 3 times faster in solving the test problems that are most signiicantly p...

1. Linear Programming Problems 1.1. Formulation of Linear Programming Problems 1.2. Examples 1.3. Different Forms of Programs and Transformations 2. Primal and Dual Programs and Polyhedra 2.1 Duality 2.2. Linear Inequalities and Polyhedra 3. The Simplex Method 3.1. The Restriction-oriented Simplex Method 3.2. The Variable-oriented Simplex Method 3.3. Modifications of Methods and Problems 3.4. T...

in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes. 

Welcome to the rst functional programming column! Functional programmers and formal methoders have much to say to each other, and this column is intended to further such communication. Functional programming supports formal methods. A large number of proof systems and other formal methods packages have been implemented in functional languages. ML, the doyen of functional languages, takes its na...