recently, gasimov and yenilmez proposed an approach for solving two kinds of fuzzy linear programming (flp) problems. through the approach, each flp problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. then, the crisp problem is solved by the use of the modified subgradient method. in this paper we will have another look at the earlier defuzzifi...

multiple objective programming (mop) problems have become famous among many researchers due to more practical and realistic implementations. there have been a lot of methods proposed especially during the past four decades. in this paper, we develop a new algorithm based on a new approach to solve mop problems by starting from a utopian point (which is usually infeasible) and moving towards the...

Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by  many researchers. Considering the quantity discount in  purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In  this paper, stochastic dyn...

In this paper we present a simple technique to derive certificates of non-realizability for combinatorial polytope. Our approach uses variant the classical algebraic introduced by Bokowski and Sturmfels (1989), final polynomials. More specifically reduce problem finding realization that positive point in variety try find polynomial with coefficients generating ideal (a polynomial), showing such...

This work introduces a sequential convex programming framework for non-linear, finitedimensional stochastic optimal control, where uncertainties are modeled by multidimensional Wiener process. We prove that any accumulation point of the sequence iterates generated is candidate locally-optimal solution original problem in sense Pontryagin Maximum Principle. Moreover, we provide sufficient condit...

a compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. directed hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. sets of extrema of birkhoff polyhedra are mapped to tours ...