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
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Decision sciences 27 (1996), S. 0 
    ISSN: 1540-5915
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Economics
    Notes: This paper presents and solves a model for the multiple supplier inventory grouping problem, which involves the minimization of logistics costs for a firm that has multiple suppliers with capacity limitations. The costs included in the model are purchasing, transportation, ordering, and inventory holding, while the firm's objective is to determine the optimal flows and groups of commodities from each supplier. We present an algorithm, which combines subgradient optimization and a primal heuristic, to quickly solve the multiple supplier inventory grouping problem. Our algorithm is tested extensively on problems of various sizes and structures, and its performance is compared to that of OSL, a state-of-the-art integer programming code. The computational results indicate that our approach is extremely efficient for solving the multiple supplier inventory grouping problem.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Oxford, UK : Blackwell Publishing Ltd
    Decision sciences 25 (1994), S. 0 
    ISSN: 1540-5915
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Economics
    Notes: We present a general model for multi-item production and inventory management problems that include a resource restriction. The decision variables in the model can take on a variety of interpretations, but will typically represent cycle times, production batch sizes, number of production runs, or order quantities for each item. We consider environments where item demand rates are approximately constant and performing an activity such as producing a batch of a product or placing an order results in the consumption of a scarceresource that is shared among the items. Some examples of shared resources include limited machine capacity, a restriction on the amount of money that can be tied up in stock, orlimited storage capacity. We focus on the case where the decision variables must be integer valued or selected from a discrete set of choices, such as when an integer number of production runs is desired for each item, or in order quantity problems where the items come in pack sizes containing more than one unit and, therefore, the order quantities must be an integer multiple of the pack sizes. We develop a heuristic and a branch and bound algorithm for solving the problem. The branch and bound algorithm includes reoptimization procedures and the heuristic to improve its performance. Computational testing indicates that the algorithms are effective for solving the general model.
    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
    Annals of operations research 38 (1992), S. 17-67 
    ISSN: 1572-9338
    Keywords: Model management systems ; mathematical programming ; modeling languages ; model formulation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper provides a survey of model management literature within the mathematical modeling domain. The first part of the survey is a review and a summary of the literature. After giving some basic definitions of modeling, modeling life cycle, and model management, two representative algebraic modeling languages followed by three approaches to modeling are introduced. These approaches are database, graph-based, and knowledge-based. The discussion is followed by a review of two specialized model management systems. The second part of the survey is a categorization of various modeling systems based on the modeling functions they provide and some of their features. These functions include life cycle support and model base administration. The degree of model independence provided by model management systems and the implemented environment systems is also summarized. The last part of the paper provides directions for future research.
    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
    Annals of operations research 20 (1989), S. XI 
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    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 20 (1989), S. 219-232 
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Network models are attractive because of their computational efficiency. Network applications can involve multiple objective analysis. Multiple objective analysis requires generating nondominated solutions in various forms. Two general methods exist to generate new solutions in continuous optimization: changing objective function weights and inserting objective bounds through constraints. In network flow problems, modifying weights is straightforward, allowing use of efficient network codes. Use of bounds on objective attainment levels can provide a more controlled generation of solutions reflecting tradeoffs among objectives. To constrain objective attainment, however, would require a side constrained network code, sacrificing some computational efficiency for greater model flexibility. We develop reoptimization procedures for the side constrained problem and use them in conjunction with simplex-based techniques. Our approach provides a useful tool for generating solutions allowing greater decision maker control over objective attainments, allowing multiobjective analysis of large-scale problems. Results are compared with solutions obtained from the computationally more attractive weighting technique. Reoptimization procedures are discussed as a means of more efficiently conducting multiple objective network analyses.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Title: Network optimization and applications; Vol. 20
    Contributer: Shetty, Bala
    Publisher: Basel :Baltzer,
    Year of publication: 1989
    Pages: 303 S.
    Series Statement: Annals of operations research Vol. 20
    Type of Medium: Book
    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...