Linear Programming Approach Clause Samples

Linear Programming Approach. In order to formulate the problem as linear programming, we follow (3.14), which we derived based on [1]. We first start by finding the equilibrium xe. Since the running cost is 0 at x = 0 or x = 6, based on the model f (x, u) = x + u, when the action is 0 or 6, it reaches the optimal state. Thus following (3.14d) we explicitly write out the equilibrium conditions as