arXiv Open Access 2013

Reducing Linear Programs into Min-max Problems

Carmi Grushko

Lihat Sumber

Abstrak

We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of my thesis.

Topik & Kata Kunci

cs.CG

Penulis (1)

Carmi Grushko

Format Sitasi

APA MLA BibTeX

Grushko, C. (2013). Reducing Linear Programs into Min-max Problems. https://arxiv.org/abs/1311.5447

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2013
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓