Pos-pos Terbaru
Komentar Terbaru
- Agussalim HM Arif pada Pedoman Pendirian Perguruan Tinggi
- afif zulfadhli pada MATERI KULIAH RISET OPERASI (OPERATION RESEARCH)
- afif zulfadhli pada MATERI KULIAH RISET OPERASI (OPERATION RESEARCH)
- Iin marit pada MATERI KULIAH RISET OPERASI (OPERATION RESEARCH)
- Iin marit pada MATERI KULIAH RISET OPERASI (OPERATION RESEARCH)
Advance Operation Research
25 Juli 2013
Bahan Kuliah
No Comments
rzabdulaziz
A bound for the number of different basic solutions generated by the simplex method
(Tomonari Kitahara · Shinji Mizuno)
Math. Program., Ser. A (2013) 137:579–586
The Simplex and Policy-Iteration Methods are Strongly Polynomial for the Markov Decision Problem with Fixed Discount
(Yinyu Ye)
MATHEMATICS OF OPERATIONS RESEARCH
Vol. 36, No. 4, November 2011, pp. 593–603
PDF (PPT) Download
A bound for the number of different basic solutions generated by the simplex method (PPT)
A bound for the number of different basic solutionsMarkov Decision Problem with Fixed DiscountThe Simplex and Policy-Iteration Methods are Strongly Polynomial