In this paper a new method based on fuzzy theory is developed to solve the project scheduling problem under fuzzy environment. Assuming that the duration of activities are trapezoidal fuzzy numbers (TFN), in this method we compute several project characteristics such as earliest times, latest times, and, slack times in term of TFN. In this method, we introduce a new approach which we call modif...

Effective constrained optimization algorithms have been proposed for engineering problems recently. It is common to consider constraint violation and algorithm as two separate parts. In this study, a pbest selection mechanism integrate the current mutation strategy in problems. Based on improved method, an adaptive differential evolution approach proposed, which helps population jump out of inf...

<p style='text-indent:20px;'>The weighted complementarity problem (wCP) can be applied to a large variety of equilibrium problems in science, economics and engineering. Since formulating an as wCP may lead highly efficient algorithms for its numerical solution, is nontrivial generalization the problem. In this paper we consider special linear (wLCP), which more general optimization Fisher...

A class of group symmetric Semi-Definite Program (SDP) is introduced by using the framework of group representation theory. It is proved that the central path and several search directions of primal-dual interior-point methods are group symmetric. Preservation of group symmetry along the search direction theoretically guarantees that the numerically obtained optimal solution is group symmetric....

The paper is a simplified exposition of an early combined phase I-phase II method for linear programming. The method works from an infeasible start. Besides, there is no need for regularity conditions if the method is applied to a primal-dual formulation.

There are several different methods to treat uncertainty in literacy. First, sensitivity analysis which is a post-optimization method analyzing stability of generated solutions. Second, stochastic programming is a modeling approach, and this method is limited to that the uncertainty is stochastic in nature. Third, “Robust Mathematical Programming” is that a candidate solutions allowing to viola...

Distributed generation (DG) based on oilfield associated gas has the characteristics of dispersive and small capacity. According to load control type, DG is treated as PQ point in power flow calculation. A distribution network reconfiguration algorithm based on simulated annealing and immune is proposed in this paper. Boltzmann simulated annealing operator is used in selection operation, and me...

This paper propose a self adaptive penalty function for solving constrained value-bilevel programming problem using genetic algorithm. This self adaptive penalty function based genetic algorithm both used in the higher level and the lower level problem's solving process. In the constraint handing method, a new fitness value called distance value, in the normalized fitness-constraint violation s...

We prove that the classic policy-iteration method (Howard 1960) and the original simplex method with the most-negative-reduced-cost pivoting rule (Dantzig 1947) are strongly polynomial-time algorithms for solving the Markov decision problem (MDP) with a fixed discount rate. Furthermore, the computational complexity of the policy-iteration and simplex methods is superior to that of the only know...