“…Our algorithm applies an exhaustive search among a grid of plowback choices at t = 0 (ranging from 0 to 100% with small increments), then goes forward and for each end-state at T 1 evaluates the optimal plowback using a new grid search for plowback choices, goes backwards to find firm value at t = 0 and then repeats the process using new plowback choices at t = 0 until the level that maximizes firm value is obtained. Further details on construction of binomial trees using a forward-backward approach are provided in Koussis et al (2013). 19 The lattice parameters for the up and down multiplicative jumps and the up and down probabilities are: Note: In panel A we assume P 0 =100, operating costs C e = 80, zero debt (C R = 0, b =1), τ = 0.3, r = r x = 0.036, δ = 0.05, σ = 0.2, T 1 =5, T 2 = 10 years and variable external financing costs v E = 0.1.…”