Electronic Resource
Springer
Mathematical methods of operations research
43 (1996), S. 161-167
ISSN:
1432-5217
Keywords:
Canonical order
;
greedy algorithm
;
linear programming
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
,
Economics
Notes:
Abstract Using the partial order technique, we describe a subclass of objective functions taking their optimum at the greedy point of a given feasible polyhedron inR n.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01680369
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |