Stochastic (or probabilistic) programming (SP) is an optimization technique in which the constraints and/or the objective function of an optimization problem contain random variables. The mathematical models of these problems may follow any particular probability distribution for model coefficients. The objective here is to determine the proper values for model parameters influenced by random e...

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

To enhance solubility and the performance of a plant gum (from south peach tree of China, SP gum) as a drilling fluid additive, we explored the potential of Modified SP (MSP) gum by modifying it with epichlorohydrin. The modification conditions, such as the mass ratio of  the crosslinking agent, pH and temperature, were optimized and the results show that 56.40 g/100g mass ratio of the cros...

to enhance solubility and the performance of a plant gum (from south peach tree of china, sp gum) as a drilling fluid additive, we explored the potential of modified sp (msp) gum by modifying it with epichlorohydrin. the modification conditions, such as the mass ratio of  the crosslinking agent, ph and temperature, were optimized and the results show that 56.40 g/100g mass ratio of the crosslin...

analyzing the nonlinear vibration of beams is one of the important issues in structural engineering. according to this, an impressive analytical method which is called modified iteration perturbation method (mipm) is used to obtain the behavior and frequency of a cantilever beam with geometric nonlinear. this new method is combined by the mickens and iteration methods. moreover, this method don...

We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which tar...

This paper deals with computational algorithms for obtaining the optimal stationary policy and the minimum cost of a discounted semi-Markov decision process. Van Nunen [23) has proposed a modified policy iteration algorithm with a suboptimality test of MacQueen type, where the modified policy iteration algorithm is policy iteration method with the policy evaluation routine by a finite number of...

The variational iteration method(VIM) was extended to find approximate solutions of fractional chemical engineering equations. The Lagrange multipliers of the VIM were not identified explicitly. In this paper we improve the VIM by using concept of fixed point iteration method. Then this method was implemented for solving system of the time fractional chemical engineering equations. The ob...