Article Abstract:
O.L. Deutsch posed a traveling-salesman problem as a zero-one linear program for the Artificial Intelligence Design Challenge for the 1987 American Institute of Aeronautics and Astronautics. When a nonlinear constraint of the problem is ignored or approximated by linearization, the linear programming problem posed by Deutsch can be solved. A software system, AIAA/SOLVER, has been developed that can solve the problem. The system is based on an assumption about the problem's stochastic cost structure using a branch-and-cut approach. The branch-and-cut approach consists of subroutines that maintain and update data structures representing a search tree. The subroutines are able to comprehend the branches of the search tree and choose a variable on which to branch next.
User Contributions:
Comment about this article or add new information about this topic:
Article Abstract:
Standard scoring rules demand knowledge of an expert's utility function. Basic reference lottery tickets can be employed to develop scoring rules which do not call for such information. Only two distinct values are possible for the final monetary reward when utility is 'linearized' by means of the basic reference lottery tickets. Utility is then a linear payoff function in terms of high reward probabilities. Expert assessments can therefore be gained even when their utility functions are not known or cannot be observed.
User Contributions:
Comment about this article or add new information about this topic:
Article Abstract:
Various production-related methods used by firms for gaining entry to foreign markets are analyzed to determine the profits firms earn by using the strategies. The entry techniques analyzed include exclusive licensing, foreign direct investment, and joint venture. Results indicate that an entering firm may be able to alter licensing charges, but the best and most popular profit-generating method is foreign direct investment.
User Contributions:
Comment about this article or add new information about this topic: