‎linear semi-infinite programming problem is an important class of optimization problems which deals with infinite constraints‎. ‎in this paper‎, ‎to solve this problem‎, ‎we combine a discretization method and a neural network method‎. ‎by a simple discretization of the infinite constraints,we convert the linear semi-infinite programming problem into linear programming problem‎. ‎then‎, ‎we use...

This paper considers a probabilistic inventory model with uniform leadtime demand and fuzzy cost components under probabilistic and imprecise constraints. Firstly we solve the model by general fuzzy non-linear programming technique. Then intuitionistic fuzzy optimization technique is applied and finally, regarding the optimization of the objective function a comparative study is presented among...

The main aim of this study, introduce a model todetermine the optimal values of the index value to minimize thetotal expected cost index and also the best decision making inselecting the industry and the region for investment by investors.For this purpose, the technique of linear programming to determinethe optimal values of the index value is used. Finally, FuzzyTOPSIS technique to prioritize ...

Linear programming relaxations have been used extensively in designing approximation algorithms for optimization problems. For vertex cover, linear programming and a thresholding technique gives a 2-approximate solution, rivaling the best known performance ratio. For a generalization of vertex cover we call vc t , in which we seek to cover t edges, this technique may not yield a feasible soluti...

stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for lar...