Search published articles


Showing 2 results for Chance Constrained Programming

Yahia Zare Mehrjerdi,
Volume 24, Issue 4 (12-2013)
Abstract

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 large scaled complex nonlinear programming problem with 0-1 type decision variables for stochastic vehicle routing problem (SVRP) is not easily available merely then the value of an approximation technique becomes imperative. In this article, theorems which build a foundation for moving toward the development of an approximate methodology for solving SVRP are stated and proved. Key Words: Vehicle Routing Problem, Chance Constrained Programming, Linear approximation, Optimization.
Yahia Zare Mehrjerdi,
Volume 25, Issue 3 (7-2014)
Abstract

Abstract It is the purpose of this article to introduce a linear approximation technique for solving a fractional chance constrained programming (CC) problem. For this purpose, a fuzzy goal programming model of the equivalent deterministic form of the fractional chance constrained programming is provided and then the process of defuzzification and linearization of the problem is started. A sample problem is presented for clarification purposes.

Page 1 from 1     

© 2020 All Rights Reserved | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb