Quadratic programming as an extension of linear programming

dc.contributor.advisorTroskie, Casper Gen_ZA
dc.contributor.authorTeixeira, Rui Len_ZA
dc.date.accessioned2015-03-13T14:06:45Z
dc.date.available2015-03-13T14:06:45Z
dc.date.issued1968en_ZA
dc.description.abstractIn the past two decades Mathematical Programming has come to occupy a place of importance in Economic Studies and in Operations Research. Roughly speaking, Mathematical Programming is the analysis of problems of the type: "Find the maximum of a function, when the variables are subject to inequality and equality constraints". The term "Linear Programming" corresponds to the case where, the function to be maximized (the so called objective function) and the equality and inequality constraints are linear. The term "Non-Linear Programming" should then become self-defined. With the introduction of Dantzig's Simplex Method, Linear Programming has become an everyday technique. The same, we regret to say, is not true for Nonlinear Programming because this subject is broader and much more difficult to unify than that of Linear Programming. In fact at present there does exist any unifying theory for Nonlinear Programming. However, we feel that research on this field is gathering tremendous momentum and that in the not too distant future Nonlinear Programming will become both a practical and fundamental tool in many spheres of Science. One of the subject matters of Nonlinear Programming is what we came to call "Quadratic Programming". This name is restricted to the specific problem of maximizing or minimizing a quadratic objective function f(X) = CX + X'DX, where CX is a linear form and X'DX a quadratic form, subject to linear constraints. Historically, Quadratic Programming was the first venture into the theory of Nonlinear Programming. More specifically it is the purpose of this thesis to: (i) Present a unified and simple treatment of the Theory of Concave (Convex) Quadratic Programming (in no way will mathematical rigour be sacrificed for simplicity). (ii) Present a collection of "Simplicial Methods" for solving quadratic programming problems, which are but extensions of the Simplex Method ( for Linear Programming, whose "accuracy" and "convergence" make them completely self-sufficient for the solution of any type of concave (convex) quadratic programming problems.en_ZA
dc.identifier.apacitationTeixeira, R. L. (1968). <i>Quadratic programming as an extension of linear programming</i>. (Thesis). University of Cape Town ,Faculty of Science ,Department of Statistical Sciences. Retrieved from http://hdl.handle.net/11427/12597en_ZA
dc.identifier.chicagocitationTeixeira, Rui L. <i>"Quadratic programming as an extension of linear programming."</i> Thesis., University of Cape Town ,Faculty of Science ,Department of Statistical Sciences, 1968. http://hdl.handle.net/11427/12597en_ZA
dc.identifier.citationTeixeira, R. 1968. Quadratic programming as an extension of linear programming. University of Cape Town.en_ZA
dc.identifier.ris TY - Thesis / Dissertation AU - Teixeira, Rui L AB - In the past two decades Mathematical Programming has come to occupy a place of importance in Economic Studies and in Operations Research. Roughly speaking, Mathematical Programming is the analysis of problems of the type: "Find the maximum of a function, when the variables are subject to inequality and equality constraints". The term "Linear Programming" corresponds to the case where, the function to be maximized (the so called objective function) and the equality and inequality constraints are linear. The term "Non-Linear Programming" should then become self-defined. With the introduction of Dantzig's Simplex Method, Linear Programming has become an everyday technique. The same, we regret to say, is not true for Nonlinear Programming because this subject is broader and much more difficult to unify than that of Linear Programming. In fact at present there does exist any unifying theory for Nonlinear Programming. However, we feel that research on this field is gathering tremendous momentum and that in the not too distant future Nonlinear Programming will become both a practical and fundamental tool in many spheres of Science. One of the subject matters of Nonlinear Programming is what we came to call "Quadratic Programming". This name is restricted to the specific problem of maximizing or minimizing a quadratic objective function f(X) = CX + X'DX, where CX is a linear form and X'DX a quadratic form, subject to linear constraints. Historically, Quadratic Programming was the first venture into the theory of Nonlinear Programming. More specifically it is the purpose of this thesis to: (i) Present a unified and simple treatment of the Theory of Concave (Convex) Quadratic Programming (in no way will mathematical rigour be sacrificed for simplicity). (ii) Present a collection of "Simplicial Methods" for solving quadratic programming problems, which are but extensions of the Simplex Method ( for Linear Programming, whose "accuracy" and "convergence" make them completely self-sufficient for the solution of any type of concave (convex) quadratic programming problems. DA - 1968 DB - OpenUCT DP - University of Cape Town LK - https://open.uct.ac.za PB - University of Cape Town PY - 1968 T1 - Quadratic programming as an extension of linear programming TI - Quadratic programming as an extension of linear programming UR - http://hdl.handle.net/11427/12597 ER - en_ZA
dc.identifier.urihttp://hdl.handle.net/11427/12597
dc.identifier.vancouvercitationTeixeira RL. Quadratic programming as an extension of linear programming. [Thesis]. University of Cape Town ,Faculty of Science ,Department of Statistical Sciences, 1968 [cited yyyy month dd]. Available from: http://hdl.handle.net/11427/12597en_ZA
dc.language.isoengen_ZA
dc.publisher.departmentDepartment of Statistical Sciencesen_ZA
dc.publisher.facultyFaculty of Scienceen_ZA
dc.publisher.institutionUniversity of Cape Town
dc.subject.otherMathematical Statisticsen_ZA
dc.titleQuadratic programming as an extension of linear programmingen_ZA
dc.typeMaster Thesis
dc.type.qualificationlevelMasters
dc.type.qualificationnameMScen_ZA
uct.type.filetypeText
uct.type.filetypeImage
uct.type.publicationResearchen_ZA
uct.type.resourceThesisen_ZA
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
thesis_sci_1968_teixeira_rl.pdf
Size:
3.17 MB
Format:
Adobe Portable Document Format
Description:
Collections