Abstracts - faqs.org

Abstracts

Business, international

Search abstracts:
Abstracts » Business, international

Solution of a tinned iron purchasing problem by Lagrangean relaxation

Article Abstract:

A tin factory encounters production and purchasing problems when tinned iron sheets demanded by clients require variant specifications. Thus, the factory has to develop a production program that minimizes purchase costs while meeting customer specifications. Such a program may integrate quantity discounts for large, one-size orders. The program is integrated as a combinatorial optimization problem and solved using Lagrangean relaxation techniques.

Author: Dorhout, B.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995
Production management

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Lagrangean methods for the 0-1 quadratic knapsack problem

Article Abstract:

Lagrangean decomposition and Lagrangean relaxation are compared in terms of their performance when used in branch-and-bound algorithms. Decomposition and relaxation are used to solve the 0-1 Quadratic Knapsack problem. Lagrangean decomposition is found to improve CPU time and the number of nodes. Decomposition provides tighter upper and lower bounds which fix more variables and reduce the number of nodes in a branch-and-bound scheme.

Author: Michelon, Philippe, Veilleux, Louis
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
Quadratic programming, Branch and bound algorithms

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Minmax combinatorial optimization

Article Abstract:

The minmax combinatorial optimization problem (MMCOP) has applications in multi-criteria optimization, categorized assignment scheduling, band width minimization in matrices and graphs, spanning tree and bipartite matching problems. MMCOP solutions require enumerative techniques or approximations from heuristic algorithms. Lagrangean relaxation generates good upper and lower bounds for enumerative solutions to MMCOP.

Author: Aneja, Y.P., Punnen, Abraham P.
Publisher: Elsevier B.V.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1995

User Contributions:

Comment about this article or add new information about this topic:

CAPTCHA


Subjects list: Research, Combinatorial optimization, Lagrangian functions
Similar abstracts:
  • Abstracts: Stronger K-tree relaxations for the vehicle routing problem. A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
  • Abstracts: Approximation algorithms for the oriented two-dimensional bin packing problem. A note on exact algorithms for the identical parallel machine scheduling problem
  • Abstracts: Innovation and cooperation under vertical product differentiation. Price competition between two international firms facing tariffs
  • Abstracts: Managerial reputation and the competitiveness of an industry
  • Abstracts: Buyer perceived service quality in industrial networks. "Coopetition" in Business Networks to Cooperate and Compete Simultaneously
This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.
Some parts © 2025 Advameg, Inc.