scientific article; zbMATH DE number 3611068

MaRDI QIDQ4175044zbMATH OpenFDO

Authors Klaus Glashoff, Sven-Åke Gustafson

Publication date 1978

zbMATH Keywords

ApproximationDualitySimplex AlgorithmLinear ProgrammingIntroductory Survey

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Cited in

(14)

• Convergent solution bounds for linear elliptic boundary value problems of monotone kind
• A New Method for Chebyshev Approximation of Complex-Valued Functions
• An algorithm for complex linear approximation based on semi-infinite programming
• Solving complex approximation problems by semiinfinite-finite optimization techniques: A study on convergence
• An interior-point method for semi-infinite programming problems
• A discretization method for systems of linear inequalities
• An upper bound for SLP using first and total second moments
• Polyextremal principles and separably-infinite programs
• On Stable Calculation of Linear Functionals
• Decision making under uncertainty: A semi-infinite programming approach
• Directional derivatives for the value-function in semi-infinite programming
• Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
• Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems
• A refinement of an optimality criterion and its application to parametric programming

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 Q4175044)