1 / 391
文档名称:

[ADM 010] Linear binatorial Optimization in Ordered Algebraic Structures - U.Zimmermann [Annals of Discrete Mathematics] (NH 1981)(T).pdf

格式:pdf   页数:391
下载后只包含 1 个 PDF 格式的文档,没有任何的图纸或源代码,查看文件列表

如果您已付费下载过本站文档,您可以点这里二次下载

[ADM 010] Linear binatorial Optimization in Ordered Algebraic Structures - U.Zimmermann [Annals of Discrete Mathematics] (NH 1981)(T).pdf

上传人:bolee65 2014/7/26 文件大小:0 KB

下载得到文件列表

[ADM 010] Linear binatorial Optimization in Ordered Algebraic Structures - U.Zimmermann [Annals of Discrete Mathematics] (NH 1981)(T).pdf

文档介绍

文档介绍:ANNALS OF DISCRETE MATHEMATICS
mathematics
Monaging Editor
Peter L. HAMMER, University of Waterloo, Ont., Canada
Advisory Editors
C. BERGE, UniversitC de Paris, France
. HARRISON, University of California, Berkeley, CA, .
V. KLEE, University of Washington, Seattle, WA, .
. VAN LINT, California Institute of Technology, Pasadena, CA, .
(’.ROTA, Massachusetts Institute of Technology, Cambridge, MA, .
ANNALS OF DISCRETE MATHEMATICS 10
LINEAR AND
COMBI NATORIAL OPT1M IZATION
IN ORDERED
A113 EBRAIC STRUCTURES
U. ZIMMERMANN
Mathematisches Institut
Universitat zu Koln
8 NORTHHOLLAND PANY - 198 1
All Rights mservui. No p~rtof this publimtion may b mprodurrd. stodin a mtrievalsystem. or trans-
mitted, in any form or by any mtuns, electronic, mechanical. photmpying. recording or otherwise,
without the prior permision of the copyright owner.
Submission to this journal of a paper entails the author's irrevocable and exclusive authorization of the
publisher to collect any sums or considerotions for copying or mpmduction payable by third parties (as
mentioned in article I7pamgroph 2 of the Dutch Copyright Act of 1912 and in the Royal kreeof June
20, 1974 (S. 351) pumant to article 166 ofthe Dutch Copyright Act of 1912) and/or to act in or out of
Court in connection themwith.
PREFACE
The object of this book is to provide an account of results and methods for linear and
combinatorial optimization problems over ordered algebraic structures. In linear
optimization the set of feasible solutions is described by a system of linear constraints;
to a large extent such linear characterizations are known for the set of feasible solutions
binatorial optimization, too. Minimization of a linear objective function subject
to linear constraints is a classical example which belongs to the class of problems
considered. In the last thirty years several optimization problems have been discussed
whi