Teknik dan Ilmu Komputer
vol. 2 no. 5 Januari-Maret 2013

PEMECAHAN MASALAH OPTIMASI BERSIFAT PROBABILISTIK MENGGUNAKAN CHANGE-CONSTRAINED PROGRAMMING

Marpaung, Budi (Unknown)



Article Info

Publish Date
18 Oct 2013

Abstract

Change-Constrained Programming (CCP) is an optimization model developed to solve probabilistic problems. In real world, particularly  in the industry, constrained coefficients and right-hand side constants cannot be firmly determined. This paper explains how the CCP is used to optimize the company profits by making various products using various machines that have limited capacity and are probabilistic. It was evident that CCP can succesfully provide an optimal solution. Keywords:  Change-Constrained Programming, level of confidence, objective function coefficient,  righ-hand-side, optimal

Copyrights © 2013