Merrill’s Algorithm

Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 124)


We will call the algorithms we have developed so far first-generation algorithms. They all suffer from computational inefficiency, caused by the following two features:
  1. (i)

    we must choose a particular grid size with which to work throughout the algorithm; and

  2. (ii)

    we must start outside the region of interest.



Grid Size Sandwich Method Labelling Rule Label Matrix Club Sandwich 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  1. 1.School of Operations Research and Industrial EngineeringCornell UniversityIthacaUSA

Personalised recommendations