Zobrazeno 1 - 10
of 81
pro vyhledávání: '"Ping-Qi PAN"'
Autor:
Ping-Qi PAN
Publikováno v:
Linear Programming Computation ISBN: 9789811901461
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f2740fa2f4d67ee5e8135809fc793010
https://doi.org/10.1007/978-981-19-0147-8_22
https://doi.org/10.1007/978-981-19-0147-8_22
Autor:
Ping-Qi Pan
Publikováno v:
Linear Programming Computation ISBN: 9789811901461
Linear Programming Computation ISBN: 9783642407536
Linear Programming Computation ISBN: 9783642407536
The mission of a dual Phase-I procedure is to provide an initial dual feasible simplex tableau (or basis) to the dual simplex method.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::90a68bbe9275cce574b3f3e3c0d25f91
https://doi.org/10.1007/978-981-19-0147-8_15
https://doi.org/10.1007/978-981-19-0147-8_15
Autor:
Ping-Qi PAN
Publikováno v:
Linear Programming Computation ISBN: 9789811901461
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6acb8f7a490ce4007111912a5bc1de0f
https://doi.org/10.1007/978-981-19-0147-8_6
https://doi.org/10.1007/978-981-19-0147-8_6
Autor:
Ping-Qi Pan
Publikováno v:
Linear Programming Computation ISBN: 9789811901461
Linear Programming Computation ISBN: 9783642407536
Linear Programming Computation ISBN: 9783642407536
In this chapter and the following two chapters, some special forms of the LP problem, introduced in Sect. 25.1, will be employed to design new LP methods. In particular, this chapter will handle the so-called “reduced problem” (25.2), i.e., $$\di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1e5f2f525b36c4378506b2ac758a5559
https://doi.org/10.1007/978-981-19-0147-8_16
https://doi.org/10.1007/978-981-19-0147-8_16
Autor:
Ping-Qi PAN
Publikováno v:
Linear Programming Computation ISBN: 9789811901461
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be4c30ef6d67d10d860a7127a030c148
https://doi.org/10.1007/978-981-19-0147-8_8
https://doi.org/10.1007/978-981-19-0147-8_8
Autor:
Ping-Qi PAN
Publikováno v:
Linear Programming Computation ISBN: 9789811901461
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7ef453acbd28e877ff2f439123546308
https://doi.org/10.1007/978-981-19-0147-8_25
https://doi.org/10.1007/978-981-19-0147-8_25
Autor:
Ping-Qi Pan
Publikováno v:
Linear Programming Computation ISBN: 9789811901461
Linear Programming Computation ISBN: 9783642407536
Linear Programming Computation ISBN: 9783642407536
In this book, pivot rules used in the dual simplex method are referred to as dual pivot rule. Like in the primal simplex context, a dual pivot rule is crucial to algorithm’s efficiency.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c506f801eff2ec8d43942cabfc62bb6
https://doi.org/10.1007/978-981-19-0147-8_13
https://doi.org/10.1007/978-981-19-0147-8_13
Autor:
Ping-Qi PAN
Publikováno v:
Linear Programming Computation ISBN: 9789811901461
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0621dd49dbb0bf68bdf6ff853c0914ac
https://doi.org/10.1007/978-981-19-0147-8_18
https://doi.org/10.1007/978-981-19-0147-8_18
Autor:
Ping-Qi PAN
Publikováno v:
Linear Programming Computation ISBN: 9789811901461
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e82f164f51bf64c1655da480f3435db6
https://doi.org/10.1007/978-981-19-0147-8_4
https://doi.org/10.1007/978-981-19-0147-8_4
Autor:
Ping-Qi PAN
Publikováno v:
Linear Programming Computation ISBN: 9789811901461
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2b4325da3ad2e8991c42fc4a0a5b544
https://doi.org/10.1007/978-981-19-0147-8_21
https://doi.org/10.1007/978-981-19-0147-8_21