Graduate Program in Industrial Engineering.Ulusoy, Gündüz.Gürman, Erdoğan.2023-03-162023-03-161977.IE 1977 G96https://digitalarchive.library.bogazici.edu.tr/handle/123456789/13165In this thesis, a solution technique to solve a class of nonlinear programming problems is presented. The problem considered is the minimization of separable concave functions and linear functions over linear polyhedra. A branch-and-bound algorithm for identifying an optimal solution is described; it is equivalent to the solution of a finite sequence of linear programming problems. Computational results are cited fbr a computer code developed implementihg the algorithm. The algorithm is applied to dynamic capacity expansion problem considering single plant-singie commodity, multi-plant-single commodity, and multi-plant-multi commodity cases.30 cm.Nonconvex programming.Nonlinear programming.Branch and bound algorithms.107 leaves;