scientific article; zbMATH DE number 3744911

MaRDI QIDQ3929385zbMATH OpenFDO

Authors St. Vajda

Publication date 1981

zbMATH Keywords

branch-and-bound algorithmcolumn-generation techniquedual simplex methodGomory cutknapsack problemmatrix gamesnetwork flowparametric programmingprogramming under uncertaintyrevised simplex methodstructured linear programstransportationtransshipment

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Numerical mathematical programming methods (65K05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic network models in operations research (90B10) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10) Stochastic programming (90C15) Sensitivity, stability, parametric optimization (90C31) Programming involving graphs or networks (90C35) 2-person games (91A05)

Cited in

(4)

• Linear programming, complexity. Separation and optimization.
• Linear programming: mathematics, theory and algorithms
• Linear and integer programming: Theory and practice.
• k-step Fibonacci sequences and Fibonacci matrices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3929385)