Perturbation theory for mathematical programming problems

DOI10.1007/BF00941069zbMath0568.90089OpenAlexW1982541069MaRDI QIDQ1061009

Vladimir Gaitsgory, Anatoli A. Pervozvanski

Publication date: 1986

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00941069

zbMATH Keywords

aggregationsingularitiesperturbationapproximate solutionDecompositionsuboptimal solutions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items (3)

Sensitivity and stability analysis for nonlinear programming ⋮ Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton ⋮ An asymptotic simplex method for singularly perturbed linear programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Differential stability in infinite-dimensional nonlinear programming
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• Nonlinear Perturbation of Linear Programs
• Differential properties of the marginal function in mathematical programming
• Objective function approximations in mathematical programming
• Convex Analysis

This page was built for publication: Perturbation theory for mathematical programming problems