A Logarithmic Barrier Approach To Solving The Dashboard Planning Problem

Abstract The dashboard planning problem is concerned with finding the most efficient arrangement of a given number of dials within a fixed-area dashboard. The objective of the problem is to ensure thai [he mental workload Dial is induced by operating the dashboard is minimized. In this paper, we formulate the dashboard planning problem as a nonlinear program that is solved using an efficient logarithmic barrier approach. The solution procedure allows the dashboard designer to consider several competitive Solutions rathei than a single optimal or near-optimal solution. We demonstrate the application of our approach on a real-world planning problem.