Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Book
    Book
    New York u.a. :Wiley,
    Title: Stochastic programming
    Author: Kall, Peter
    Contributer: Wallace, Stein W.
    Publisher: New York u.a. :Wiley,
    Year of publication: 1994
    Pages: 307 S.
    Series Statement: Wiley-Interscience series in systems and optimization
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Bradford : Emerald
    The @journal of risk finance 6 (2005), S. 40-46 
    ISSN: 1526-5943
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Economics
    Notes: Purpose - Discusses why it is necessary to align a mathematical model with the organization in order to achieve the desired results. The structure of a model's input must fit with the structure of data collection in the firm, and the output must be consistent with the decision structure. Otherwise, data collection will not be properly taken care of and the results of a model will not find their way to where decisions are made. Five years passed from the cooperation first started with the university until the model came on-line. Design/methodology/approach - Parts 1 and 2 of this series of papers discussed the stochastic programming model itself and the relationship between the model and the organization. The results are now reported. Findings - Reports on both organizational and financial results. Practical implications - Shows that, although a lot of work is needed to implement a complicated stochastic programming model within an organization, it can be done and can lead to good results. However, it takes time to adjust an organization to a new way of thinking, as a model like this can never work unless supported by upper management as well as those who use the model daily. Originality/value - The main value is to demonstrate in rather large detail how a somewhat complicated model can be developed and used in an organization, which, originally, was not well aligned with the ideas of the modellers.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 61 (1993), S. 111-129 
    ISSN: 1436-4646
    Keywords: Stochastic programs ; multi-stage ; upper bound
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The purpose of this paper is to present general approaches for bounding some multi-stage stochastic programs from above. The results are based on restricting the solution set, such that the remaining multi-stage stochastic program is easy to solve. An example where the methods can be applied is presented.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 62 (1993), S. 215-222 
    ISSN: 1436-4646
    Keywords: Facets ; convex polyhedral set ; feasible flow ; Gale—Hoffman inequalities
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The Gale—Hoffman inequalities characterize feasible external flow in a (capacitated) network. Among these inequalities, those that are redundant can be identified through a simple arc-connectedness criterion.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 64 (1996), S. 237-259 
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper discusses the use of different pricing and ordering schemes when solving many linear programs that differ only in the right-hand sides. This is done in a setting of what has become known as bunching or trickling down. The idea is to collect (bunch) all right-hand sides that have the same optimal basis, and to organize the search for these bases efficiently. We demonstrate that the choice of pricing rule is indeed very important, but we were not able to make conclusions regarding ordering schemes. Numerical results are given.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 64 (1996), S. 197-210 
    ISSN: 1572-9338
    Keywords: Feasibility ; uncapacitated network ; Gale-Hoffman inequality ; linear programming ; frame ; cut ; facet ; polar matrix
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract The purpose of this paper is to investigate the effect of individual arcs and nodes on the description of feasibility in an uncapacitated network. This is done by developing an iterative algorithm for finding all (necessary) Gale-Hoffman inequalities for the network.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 100 (2000), S. 25-53 
    ISSN: 1572-9338
    Keywords: scenarios and scenario trees ; clustering ; importance sampling ; matching moments ; problem oriented requirements ; inference and bounds
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract A major issue in any application of multistage stochastic programming is the representation of the underlying random data process. We discuss the case when enough data paths can be generated according to an accepted parametric or nonparametric stochastic model. No assumptions on convexity with respect to the random parameters are required. We emphasize the notion of representative scenarios (or a representative scenario tree) relative to the problem being modeled.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 31 (1991), S. 425-444 
    ISSN: 1572-9338
    Keywords: Stochastic programming ; discrete optimal control ; scenario aggregation ; dynamic optimization ; multistage decision making ; decomposition ; approximation ; fisheries models
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper describes how the scenario aggregation principle can be combined with approximate solutions of the individual scenario problems, resulting in a computationally efficient algorithm where two individual Lagrangian-based procedures are merged into one. Computational results are given for an example from fisheries management. Numerical experiments indicate that only crude scenario solutions are needed.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 31 (1991), S. 445-455 
    ISSN: 1572-9338
    Keywords: Stochastic programming ; scenario aggregation ; progressive hedging algorithm ; data structures ; generic algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This short note discusses some structural properties of the progressive hedging algorithm. It is based on the finite case, but allows for event trees that are unbalanced and where the nodes can have a varying number of children. Generic procedures and a generic record definition for the algorithms are presented.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 82 (1998), S. 1-8 
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In project planning and control, it is of vital importance to take into account that differentcategories of resources have different work patterns. Algorithms for time analysis, resourcesmoothing and resource scheduling are almost always presented as if this has no importance.Practical planning tools, however, have different work patterns as a natural part of the data.In this paper, we discuss modelling aspects of introducing work patterns.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...