Plans Are Worthless but Planning Is Everything: A Theoretical Explanation of Eisenhower's Observation

@inproceedings{Contreras2020PlansAW,
  title={Plans Are Worthless but Planning Is Everything: A Theoretical Explanation of Eisenhower's Observation},
  author={Angel F. Garcia Contreras and Martine Ceberio and Vladik Kreinovich},
  booktitle={Decision Making under Constraints},
  year={2020}
}
The 1953–1961 US President Dwight D. Eisenhower emphasized that his experience as the Supreme Commander of the Allied Expeditionary Forces in Europe during the Second World War taught him that “plans are worthless, but planning is everything”. This sound contradictory: if plans are worthless, why bother with planning at all? In this paper, we show that Eisenhower’s observation has a meaning: while directly following the original plan in constantly changing circumstances is often not a good idea… Expand
1 Citations

Topics from this paper

AN INVESTIGATION ON CREATIVITY PERFORMANCE IN THE CONTEXT OF LEADERSHIP STYLES AND INDIVIDUAL ENTREPRENEURSHIP
Entrepreneurs are similar to leaders in terms of individual characteristics. At the same time, entrepreneurs who have high creative performance are considered as successful. This study aims toExpand

References

SHOWING 1-10 OF 11 REFERENCES
Decision making beyond arrow's “impossibility theorem,” with the analysis of effects of collusion and mutual attraction
In 1951, K.J. Arrow proved that, under certain assumptions, it is impossible to have group decision-making rules that satisfy reasonable conditions like symmetry. This Impossibility Theorem is oftenExpand
Decision making beyond arrow's “impossibility theorem,” with the analysis of effects of collusion and mutual attraction
In 1951, K.J. Arrow proved that, under certain assumptions, it is impossible to have group decision‐making rules that satisfy reasonable conditions like symmetry. This Impossibility Theorem is oftenExpand
Computational Complexity and Feasibility of Data Processing and Interval Computations
Preface. 1. Informal Introduction: Data Processing, Interval Computations, and Computational Complexity. 2. The Notions of Feasibility and NP-Hardness: Brief Introduction. 3. In the General Case, TheExpand
Complexity in numerical optimization
Average performance of self-dual interior point algorithm for linear programming, K.M. Anstreicher et al the complexity of approximating a nonlinear program, M. Bellare and P. Rogaway algorithms forExpand
  • 1989
A speech to the National Defense Executive Reserve Conference in
  • Public Papers of the Presidents of the United States, National Archives and Records Service, Government Printing Office
  • 1957
A speech to the National Defense Executive Reserve Conference in Washington, D.C., November 14, 1957
  • Public Papers of the Presidents of the United States, National Archives and Records Service, Government Printing Office,
  • 1957
    ...
    1
    2
    ...