Local Hillclimbing on an Economic Landscape

نویسنده

  • David Kane
چکیده

Profit maximization is difficult. Sophisticated and experienced managers often disagree about which action is most likely to maximize profits for a given firm. Economic models of profit maximization, on the other hand, are—in general—easy to solve. Well-trained economists can readily discern the action which maximizes the firm’s objective function. The global maximum is unique and achievable because the objective function is designed to have this property. This paper weakens the assumption of analytically tractable objective functions. I propose a model of profit maximization in which it is, essentially, impossible for the firm to discover the global maximum. Firms have no choice but to, in the words of Charles Lindblom, “muddle through” in their attempt to find the optimal budgetary allocation in an extremely complex economic landscape [9]. Computer simulations provide details of that landscape as well as evidence that certain strategies may be more effective in difficult environments. Specifically, “patience” may be a virtue that applies to firms as well as to people.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Reverse Hillclimbing and Iterated Local Search

This paper analyzes the detection of stagnation states in iterated local search algorithms. This is done considering elements such as the population size, the length of the encoding and the number of observed non-improving iterations. This analysis isolates the features of the target problem within one parameter for which three different estimations are given: two static a priori estimations an...

متن کامل

Reverse HillclimbingGenetic Algorithms and the Busy Beaver Problem

This paper introduces a new analysis tool called reverse hillclimbing, and demonstrates how it can be used to evaluate the performance of a genetic algorithm. Using reverse hillclimbing, one can calculate the exact probability that hillclimbing will attain some point in a landscape. From this, the expected number of evaluations before the point is found by hillclimbing can be calculated. This f...

متن کامل

Evaluation of Ecological Vulnerability in Chelgard Mountainous Landscape

Although complexity and vulnerability assessment of mountain landscapes is increasingly taken into consideration, less attention is paid to ecophronesis-based solutions so as to reduce the fragile ecosystem vulnerability. The main propose of this study is to provide an insight of mountain complex landscape vulnerability and propose ecophronesis-based solutions in strategic planning framework fo...

متن کامل

Reinforcement Learning and Local Search: A Case Study

We describe a reinforcement learning-based variation to the combinatorial optimization technique known as local search. The hillclimbing aspect of local search uses the problem's primary cost function to guide search via local neighborhoods to high quality solutions. In complicated optimization problems, however, other problem characteristics can also help guide the search process. In this repo...

متن کامل

Binary and Gray Encoding in Univariate Marginal Distribution Algorithm, Genetic Algorithm, and Stochastic Hillclimbing

This paper employs a Markov model to study the relative performance of binary and Gray coding in the univariate marginal distribution algorithm, genetic algorithm, and stochastic hillclimbing. The results indicate that while there is little difference between the two for all possible functions, Gray coding does not necessarily improve performance for functions which have fewer local optima in t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996