On the use of purely finitely additive multipliers in mathematical programming (Q1132741): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Recourse Problem in Discrete Time: $L^1 $-Multipliers for Inequality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finitely Additive Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093216 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00935175 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2160154266 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:28, 30 July 2024

scientific article
Language Label Description Also known as
English
On the use of purely finitely additive multipliers in mathematical programming
scientific article

    Statements

    On the use of purely finitely additive multipliers in mathematical programming (English)
    0 references
    0 references
    1981
    0 references
    programming in abstract spaces
    0 references
    duality
    0 references
    countably additive multipliers
    0 references
    purely finitely additive multipliers
    0 references
    singular nonpositivity
    0 references

    Identifiers