Rate the Article: Approximation in Linear Stochastic Programming Using L-Shaped Method, IJSR, Call for Papers, Online Journal
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 103 | Views: 461

M.Tech / M.E / PhD Thesis | Mathematics | Indonesia | Volume 3 Issue 11, November 2014 | Rating: 6.6 / 10


Approximation in Linear Stochastic Programming Using L-Shaped Method

Liza Setyaning Pertiwi, Rini Purwanti, Wilma Handayani, Prof. Dr. Herman Mawengkang


Abstract: Approximation algorithm is inveterate solution method in stochastic programming because the problem of stochastic programming is very difficult solved. Therefore, most research in this case is focussed for designing the solution method which approximate optimal solution. This research tells a strategy to finish the problem of stochastic linear programming by approximation with L-Shaped method. This thesis gets result of approximation for stochastic model by fulfilling all linear constraint where optimal solution reached depend on selected partition.


Keywords: Stochastic linear program, Convex approximation, LShaped Method


Edition: Volume 3 Issue 11, November 2014,


Pages: 1235 - 1241



Rate this Article


Select Rating (Lowest: 1, Highest: 10)

5

Your Comments (Only high quality comments will be accepted.)

Characters: 0

Your Full Name:


Your Valid Email Address:


Verification Code will appear in 2 Seconds ... Wait

Top