Theory and applications of a nonconvex programming algorithm

dc.contributor	Graduate Program in Industrial Engineering.
dc.contributor.advisor	Ulusoy, Gündüz.
dc.contributor.author	Gürman, Erdoğan.
dc.date.accessioned	2023-03-16T10:27:48Z
dc.date.available	2023-03-16T10:27:48Z
dc.date.issued	1977.
dc.identifier.other	IE 1977 G96
dc.identifier.uri	http://digitalarchive.boun.edu.tr/handle/123456789/13165
dc.description.abstract	In 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.
dc.format.extent	30 cm.
dc.publisher	Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 1977.
dc.relation	Includes appendices.
dc.relation	Includes appendices.
dc.subject.lcsh	Nonconvex programming.
dc.subject.lcsh	Nonlinear programming.
dc.subject.lcsh	Branch and bound algorithms.
dc.title	Theory and applications of a nonconvex programming algorithm
dc.format.pages	107 leaves;