Bringing Non-governmental Actors into the Policymaking Process: The Case of Local Development Policy in Thailand

During the past two decades in Thailand, non-governmental actors, such as NGOs, intellectuals, and people's organizations, have found widening opportunities to participate in policy formation and in the implementation of local development. The government has facilitated the formation of civil society forums, in the expectation of influencing local-level governance. The last two national five-year development plans were formulated after taking into account the voices of people in the provinces. Even though they may seem petty, some state funds are now transmitted through non-governmental institutions for policy implementation at the grassroots level. These changes have their origin in a reformation of rural development administration in early 1980s. This reformation in due course led to policies that have allowed the participation of non-governmental actors. Meanwhile, rural people have proved their ability to engage in participatory development by forming various local organizations, while NGOs have grown to be proficient facilitators of local development. This paper describes the process whereby three leading actors, namely the government, local people, and the NGOs, have interacted to bring about a more participatory system of local development administration.

Column Generation Algorithms for Nonlinear Optimization II: Numerical Investigations

García et al. present a class of column generation (CG) algorithms for nonlinear programs. Its main motivation from a theoretical viewpoint is that under some circumstances, finite convergence can be achieved, in much the same way as for the classic simplicial decomposition method; the main practical motivation is that within the class there are certain nonlinear column generation problems that can accelerate the convergence of a solution approach which generates a sequence of feasible points. This algorithm can, for example, accelerate simplicial decomposition schemes by making the subproblems nonlinear. This paper complements the theoretical study on the asymptotic and finite convergence of these methods given in [1] with an experimental study focused on their computational efficiency. Three types of numerical experiments are conducted. The first group of test problems has been designed to study the parameters involved in these methods. The second group has been designed to investigate the role and the computation of the prolongation of the generated columns to the relative boundary. The last one has been designed to carry out a more complete investigation of the difference in computational efficiency between linear and nonlinear column generation approaches. In order to carry out this investigation, we consider two types of test problems: the first one is the nonlinear, capacitated single-commodity network flow problem of which several large-scale instances with varied degrees of nonlinearity and total capacity are constructed and investigated, and the second one is a combined traffic assignment model