Abstracts - faqs.org

Abstracts

Business, general

Search abstracts:
Abstracts » Business, general

A short-cut potential reduction algorithn for linear programming

Article Abstract:

Decomposition techniques which can reduce the amount of work involved in linear programming interior point methods such as dual affine scaling and dual potential reduction algorithms. The value of these decomposiitoning methods are assessed through a comparative analysis of the dual potential reduction algorithm and a set of decompositioning randomly-generated transportation problems, without subjecting the first set of variables to decompositioning techniques. These techniques are validated by testing implementation details and computational results of one such technique. The study shows that decomposition of variables prove to be a useful method for resolving a given problem when the number of variables exceed the number of constraints. The decomposition method allow matrix calculations to be performed on a smaller set of variables.

Author: Kaliski, John A., Yinyu Ye
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1993
Linear programming, Usage, Decomposition method, Potential theory (Mathematics)

User Contributions:

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

CAPTCHA


A theory of cutoff formation under imperfect information

Article Abstract:

A study is conducted to examine the use of a cutoff to limit subsequent evaluations and the ways in which this heuristic can be applied optimally. In this heuristic, the number of alternatives is limited using a screening strategy that involves two general methods: Quota cutoffs and Level cutoffs. The Quota method determines the optimal number of options to evaluate, while the Level method determines the lowest acceptable level of the imperfect screening indicator. Aside from defining the two methods, the study introduces the concomitants of order statistics as a strategy for examining decision problems involving imperfect information. It also explores the role of fallback options in a large class of search problems.

Author: Huber, Joel, Feinberg, Fred M.
Publisher: Institute for Operations Research and the Management Sciences
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1996
Decision-making, Decision making, Optimal stopping (Mathematical statistics), Order statistics

User Contributions:

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

CAPTCHA



Subjects list: Models, Analysis
Similar abstracts:
  • Abstracts: Expected utility, penalty functions, and duality in stochastic nonlinear programming. Use of sample information in stochastic resource and chance-constrained programming models
  • Abstracts: A comparative evaluation of heuristic line balancing techniques
  • Abstracts: A laboratory market investigation of low balling in audit pricing. An examination of the effects of experience and task complexity on audit judgments
  • Abstracts: The two cultures in business education. The organizational impact of profit sharing
  • Abstracts: An empirical look at franchising as an organizational form. Testing for nonlinear dependence in daily foreign exchange rates
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.