Book Chapter

Pathways to the Optimal Set in Linear Programming

  • Megiddo N
Springer New York, (1989), 131-158
DOI: 10.1007/978-1-4613-9617-8_8
N/ACitations
Citations of this article
33Readers
Mendeley users who have this article in their library.
Get full text

Abstract

… For convenience, we introduce notation that is usually used in the context of the linear complementarity problem. We denote by z = z(ll) the (n + m)-vector obtained by concatenating x(ll) …

Cite

CITATION STYLE

APA

Megiddo, N. (1989). Pathways to the Optimal Set in Linear Programming. In Progress in Mathematical Programming (pp. 131–158). Springer New York. https://doi.org/10.1007/978-1-4613-9617-8_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free