Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
4
views
10
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
342
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Lineare Programmierung und Erweiterungen
Konvexe Programmierung
other
Author(s):
George B. Dantzig
Publication date
(Print):
1966
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
ScienceOpen Research
Most cited references
10
Record
: found
Abstract
: not found
Article
: not found
Minimization of non-linear separable convex functionals
A. Charnes
,
C. E. Lemke
(1954)
0
comments
Cited
14
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
THE DEFINITION OF A GAME AND THE MIN-MAX THEOREM
SAMUEL KARLIN
(1959)
0
comments
Cited
4
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
The Use of Mathematics in Production and Inventory Control—II (Theory of Scheduling)
Andrew Vazsonyi
(1955)
0
comments
Cited
4
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
1966
Pages
: 534-565
DOI:
10.1007/978-3-642-87362-1_24
SO-VID:
81cb0bbe-8bf6-48f9-bc55-238ad4534e97
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
Einleitung
pp. 1
Der Begriff der linearen Programmierung
pp. 14
Ursprünge und Einwirkungen
pp. 5
Entscheidungsmodelle als Grundlage von Sensitivitätsanalysen
pp. 25
Sensitivitätsanalysen auf der Grundlage von Entscheidungsmodellen
pp. 38
Aufstellung eines linearen Programmierungsmodells
pp. 45
Lineare Programmierung, ein Überblick
pp. 80
Lineare Gleichungs- und Ungleichungssysteme
pp. 110
Die Simplexmethode
pp. 71
Sensitivitätsanalysen bei linearen Programmen ohne Berücksichtigung der parametrischen Programmierung
pp. 139
Beweis des Simplexalgorithmus und des Dualitätssatzes
pp. 90
Parametrische lineare Programmierung
pp. 150
Zielfunktionale Sensivititätsanalysen
pp. 171
Die Geometrie linearer Programme
pp. 200
Pivot-Operationen, Vektorräume, Matrizen und ihre Inversen
pp. 243
Die Simplexmethode mit Benutzung von Multiplikatoren
pp. 262
Endlichkeit der Simplexmethode bei Störung
pp. 275
Varianten des Simplexalgorithmus
pp. 292
Der Preisbegriff in der linearen Programmierung
pp. 318
Spiele und lineare Programme
pp. 343
Das klassische Transportproblem
pp. 361
Optimale Zuordnung und andere Zuteilungsprobleme
pp. 382
Das Umladeproblem
pp. 400
Netzwerke und das Umladeproblem
pp. 418
Variablen mit oberen Grenzen
pp. 438
Maximaler Fluß in Netzwerken
pp. 458
Die primale-duale Methode bei Transportproblemen
pp. 468
Das Problem der gewichteten Zuteilung
pp. 490
Programme mit veränderlichen Koeffizienten
pp. 507
Ein Dekompositionsprinzip für lineare Programme
pp. 534
Konvexe Programmierung
pp. 566
Ungewißheit
pp. 583
Extremalprobleme mit diskreten Variablen
pp. 625
Stiglers Ernährungsmodell, Beispiel einer Formulierung und Lösung
pp. 644
Das Aufstellen eines Flugplans bei ungewisser Nachfrage
Similar content
342
�ber die affine Exzentrizit�t konvexer K�rper
Authors:
Kurt Leichtweiss
Konvexe mengen in projektiven raumen
Authors:
Reinhard Deumlich
,
Karl-Heinz Elster
Verallgemeinerte konvexe Funktionen
Authors:
Ernst-august Weiss
See all similar