Preference structure representation using convex cones in multicriteria integer programming
Article Abstract:
An interactive branch-and bound method has been developed to provide a mathematical representation of a decision-maker's preference in the solving of multi-criteria integer programming problems, based on a modified approach to the procedures of Zionts and Wallenius (1983). An algorithmic framework for multi-criteria integer programming is developed by integrating the mathematical representation with branch- and bound procedure using convex cones. With appropriate modification, the methodology can be used in solving multi-criteria problems characterized by choosing among alternatives, and can be applied to such areas of decision-making as: project selection, strategic planning, and engineering design. integer planning.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1989
User Contributions:
Comment about this article or add new information about this topic:
Use of convex cones in interactive multiple objective decision making
Article Abstract:
Interactive optimization is an approach that can be effectively used to solve decision problems that are characterized by multiple objectives. Decision making techniques derived from this approach usually examine the preference structure of decision makers. As a result, convx cones were developed by statisticians for use in preference structure representation. However, new cones known as 'p' cones offer improvements in terms of convergence capabilities and reduced preference information requirements. ' Acceleration' and 'Early Termination' procedures based on the 'p' cones can be used to solve problems in Multiple Objective Linear Programming.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
A branch-and-bound method for the fixed charge transportation problem
Article Abstract:
A branch-and-bound technique for solving the fixed-charge transportation problem was developed, and the impact of a problem's parameters on the problem's difficulty was investigated. The newly developed conditional penalties considerably reduced enumeration and solution times for difficult fixed-charge transportation problems. The difficulty of problems with as many as 40 origins and 40 destinations was considerably influenced by the proportion of fixed costs to variable costs, the problem's shape, and the arc density of the network and the fixed charge.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1990
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Corporate rejuvenation. Taxonomic mental models in competitor definition
- Abstracts: Toshiba's new president, Fumio Sato, comes from electrical apparatus side. Texas Instruments agrees to buy HDTV technology from Japan
- Abstracts: ComputerLand posts $13.9 million loss for 3rd period, citing control problems. Businessland's top marketing, sales executives leave
- Abstracts: Debut of firm's shares marks comeback of Japan's personal-computer guru. New U.S. semiconductor pact irks some Japanese companies