scientific article

zbMath0647.90053MaRDI QIDQ4039985

J. G. Ecker, Michael Kupferschmid

Publication date: 5 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

unconstrained optimizationsimulationbranch and boundDualitySensitivity AnalysisKarush-Kuhn-Tucker methodNetwork Flowoptimization in queuesrevised simplex algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (9)

List partitions ⋮ Optimizing a linear function over an efficient set ⋮ Residual generation and fault detection for discrete-time systems using an l∞ technique ⋮ Proximity curves for potential-based clustering ⋮ Active set strategies in an ellipsoid algorithm for nonlinear programming ⋮ An ellipsoid algorithm for equality-constrained nonlinear programs ⋮ Classroom notes An interpretation of the B‐spline in probability ⋮ Discrete-continuous scheduling problems -- mean completion time results ⋮ Degeneracy graphs: Theory and applications. An updated survey

This page was built for publication: