scientific article; zbMATH DE number 193847

MaRDI QIDQ4040645zbMATH OpenFDO

Authors Michel Minoux

Publication date 5 June 1993

zbMATH Keywords

constrained optimizationdual methodsinfinite-dimensional programmingprimal methodsunconstrained optimization

Mathematics Subject Classification ID

Decomposition methods (49M27) Numerical mathematical programming methods (65K05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Nonlinear programming (90C30) Dynamic programming (90C39) Programming in abstract spaces (90C48)

Cited in

(6)

• Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
• Problem of optimal choice of a route under conditions of time discounting
• On one construction of the decomposition of an extremal multicriteria problem
• On certain optimization methods with finite-step inner algorithms for convex finite-dimensional problems with inequality constraints
• Parametric dual regularization for an optimal control problem with pointwise state constraints
• Geometric algorithms for finding a point in the intersection of balls

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