Perencanaan Jaringan dengan Permintaan Acak menggunakan Chance Constrained Programming

Abstract

Chance constrained programming (CCP) is one part of stochastik programming which developed by Charnes and Cooper. Chance constrained programming technique is one which can be used to solve problems involving chance constraints, in this paper the writer try to use chance constrained programming as a model in network design under demand uncertainty (the using of bandwidth. e.g. random dowload and upload). in this case the writer use chance constrained programming to find a searching routes model and optimal bandwidth allocation in a network, so will be find a network with optimal bandwidth allocation in that network. Chance constrained programming is proper to use in this problem cause this model can united the uncertainty demand in the network and level of guarantee that network management want give to the users of the network. key words : Chance Constrained Programming, Random Demand, Network Planning