A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing (Q3111142): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331934.2011.619263 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054709617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior semi-infinite programming method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An accelerated central cutting plane algorithm for linear semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static arbitrage bounds on basket option prices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static-arbitrage optimal subreplicating strategies for basket options / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static-arbitrage upper bounds for the prices of basket options / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Upper and Lower Bounds for Basket Options / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static-arbitrage lower bounds on the prices of basket options via linear programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:08, 4 July 2024

scientific article
Language Label Description Also known as
English
A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references