Advance Operation Research

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)

Tinggalkan Balasan

Isikan data di bawah atau klik salah satu ikon untuk log in:

Logo WordPress.com

You are commenting using your WordPress.com account. Logout / Ubah )

Gambar Twitter

You are commenting using your Twitter account. Logout / Ubah )

Foto Facebook

You are commenting using your Facebook account. Logout / Ubah )

Foto Google+

You are commenting using your Google+ account. Logout / Ubah )

Connecting to %s