On the use of purely finitely additive multipliers in mathematical programming

DOI10.1007/BF00935175zbMath0419.90082OpenAlexW2160154266MaRDI QIDQ1132741

S. H. Smith

Publication date: 1981

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

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

zbMATH Keywords

dualityprogramming in abstract spacescountably additive multiplierspurely finitely additive multiplierssingular nonpositivity

Mathematics Subject Classification ID

Numerical methods involving duality (49M29) Programming in abstract spaces (90C48)

Related Items (8)

A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems ⋮ Circumventing the Slater conundrum in countably infinite linear programs ⋮ The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization ⋮ An extension of the Kaliszewski cone to non-polyhedral pointed cones in infinite-dimensional spaces ⋮ Strong duality and sensitivity analysis in semi-infinite linear programming ⋮ Strategic growth with recursive preferences: decreasing marginal impatience ⋮ Dualizing optimization problems in mathematical economics ⋮ Optimality conditions and Lagrangian duality in continuous-time nonlinear programming

Cites Work

• Unnamed Item
• Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility
• The Optimal Recourse Problem in Discrete Time: $L^1 $-Multipliers for Inequality Constraints
• Finitely Additive Measures

This page was built for publication: On the use of purely finitely additive multipliers in mathematical programming