Reduction and Discrete Approximation in Linear Semi-Infinite Programming (Q3780757): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A note on perfect duality and limiting lagrangeans / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct theorems in semi-infinite convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representations of Semi-Infinite Programs which Have No Duality Gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infinite Linear Program with a Duality Gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundedness relations in linear semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farkas-Minkowski systems in semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extrema of probability determined by generalized moments. I: Bounded random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform duality in semi-infinite convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality gaps in semi-infinite linear programming—an approximation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: In a semi-infinite program only a countable subset of the constraints is essential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect duality in infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank

Latest revision as of 16:32, 18 June 2024

scientific article
Language Label Description Also known as
English
Reduction and Discrete Approximation in Linear Semi-Infinite Programming
scientific article

    Statements

    Reduction and Discrete Approximation in Linear Semi-Infinite Programming (English)
    0 references
    0 references
    0 references
    0 references
    1987
    0 references
    0 references
    approximation
    0 references
    discretization
    0 references
    finite reduction
    0 references
    Haar's duality
    0 references
    linear semi-infinite system
    0 references
    reductible
    0 references
    finite subproblem
    0 references
    discretizable
    0 references
    sequence of perturbed finite subproblems
    0 references
    countable subproblems
    0 references
    0 references