A Simplex Method for Countably Infinite Linear Programs | PERPUSTAKAAN UNIVERSITAS KATOLIK PARAHYANGAN

Pencarian berdasarkan :

Pencarian terakhir:

Text

A Simplex Method for Countably Infinite Linear Programs

Ghate, Archis - Nama Orang; Smith, Robert L. - Nama Orang; Ryan, Christopher T. - Nama Orang;

We introduce a simplex method for general countably infinite linear programs. Previous literature has focused on special cases, such as infinite network flow problems or Markov decision processes. A novel aspect of our approach is the placing of data and decision variables in a Hilbert space that elegantly encodes a “discounted” weighting to ensure the continuity of infinite sums. Under some assumptions, including that all basic feasible solutions are nondegenerate with strictly positive support and the set of bases is closed in an appropriate topology, we show convergence to the optimal value for our proposed simplex algorithm. We show that existing applications naturally fit this more general framework.

Ketersediaan

Barcode		Tipe Koleksi	Nomor Panggil	Lokasi	Status
art140691	null	Artikel		Gdg9-Lt3	Tersedia namun tidak untuk dipinjamkan - No Loan

Informasi Detail

Judul Seri: SIAM JOURNAL ON OPTIMIZATION; Vol.31 No.4 October-December 2021
No. Panggil: -
Penerbit: : .,
Deskripsi Fisik: p. 3157-3183
Bahasa: English
ISBN/ISSN: -
Klasifikasi: NONE
Tipe Isi: -
Tipe Media: -
Tipe Pembawa: -
Edisi: -
Subjek: SIMPLEX METHOD
INFINITE-DIMENSIONAL OPTIMIZATION
COUNTABLY INFINITE LINEAR PROGRAMS
Info Detail Spesifik: https://doi.org/10.1137/19M1303939
Pernyataan Tanggungjawab: Archis Ghate, Christopher T. Ryan, Robert L. Smith

Versi lain/terkait

Tidak tersedia versi lain

Lampiran Berkas

Tidak Ada Data

Komentar

Anda harus masuk sebelum memberikan komentar