{"id":{"repo_id":"texas","oai_identifier":"oai:repositories.lib.utexas.edu:2152/1663"},"canonical_url":"https://search.ndltd.org/etd/texas/oai:repositories.lib.utexas.edu:2152/1663","repository":{"repo_id":"texas","name":"University of Texas","base_url":"https://repositories.lib.utexas.edu/server/oai/request"},"display":{"title":"OQGRG: a multi-start algorithm for global solution of nonlinear and mixed integer programs","abstract":"Economical, managerial, engineering, and natural systems are often represented by nonlinear equations and inequalities, using discrete and continuous variables. Global Optimization provides methodologies to find the global solutions for the prescriptive models that attempt to describe, predict, and optimize their behavior. OQGRG, the algorithm presented in this dissertation, was developed to solve problems in this large target class of mixed integer, nonlinear, constrained optimization models that often have multiple local optima. OQGRG is a multi-start, 2-stage, global optimization algorithm that combines the efficiency of the Scatter Search meta-heuristic and the power of a reduced gradient nonlinear solver. It uses OptQuest as the implementation of Scatter Search and Lsgrg2 as a nonlinear local solver. OQGRG is written in standard ANSI C, and a GAMS interface provides access to many test problems available in the literature. The effectiveness of the algorithm is demonstrated by solving 155 of 159 test problems within 1% of their best known solutions.","abstract_html":"Economical, managerial, engineering, and natural systems are often represented by nonlinear equations and inequalities, using discrete and continuous variables. Global Optimization provides methodologies to find the global solutions for the prescriptive models that attempt to describe, predict, and optimize their behavior. OQGRG, the algorithm presented in this dissertation, was developed to solve problems in this large target class of mixed integer, nonlinear, constrained optimization models that often have multiple local optima. OQGRG is a multi-start, 2-stage, global optimization algorithm that combines the efficiency of the Scatter Search meta-heuristic and the power of a reduced gradient nonlinear solver. It uses OptQuest as the implementation of Scatter Search and Lsgrg2 as a nonlinear local solver. OQGRG is written in standard ANSI C, and a GAMS interface provides access to many test problems available in the literature. The effectiveness of the algorithm is demonstrated by solving 155 of 159 test problems within 1% of their best known solutions.","abstract_has_math":false,"creators":["Ugray, Zsolt Gyula"],"institution":"The University of Texas at Austin","degree_name":"Doctor of Philosophy","degree_level":"Doctoral","degree_discipline":"Business Administration","degree_department":"Business Administration","school":null,"contributors":[],"advisors":["Lasdon, Leon S."],"committee_chairs":[],"committee_members":[],"year":2001,"date_issued":"2001","date_published":"2001","updated_at":"2026-11-20T21:52:05Z","subjects":["Mathematical optimization--Computer programs","Nonlinear programming","Integer programming"],"languages":["eng"],"rights":["Copyright is held by the author. Presentation of this material on the Libraries' web site by University Libraries, The University of Texas at Austin was made possible under a limited license grant from the author who has retained all copyrights in the works."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.oclc","label":"OCLC","values":["61503058"],"render_values":[{"text":"61503058","href":null,"code":true}]},{"key":"dc:identifier","label":"Identifier","values":["b59974023"],"render_values":[{"text":"b59974023","href":null,"code":true}]},{"key":"dc:identifier.proquest","label":"Dc Identifier Proquest","values":["3055256"],"render_values":[{"text":"3055256","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/2152/1663","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/2152/1663","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://repositories.lib.utexas.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Arepositories.lib.utexas.edu%3A2152%2F1663","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Lasdon, Leon S."]},{"key":"dc:contributor.department","label":"Department","values":["Business Administration"]},{"key":"dc:creator","label":"Author","values":["Ugray, Zsolt Gyula"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2008-08-28T22:10:47Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2008-08-28T22:10:47Z"]},{"key":"dc:date.issued","label":"Date","values":["2001"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_department","label":"Department","values":["Business Administration"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Business Administration"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctoral"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["The University of Texas at Austin"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject.lcsh","label":"Dc Subject Lcsh","values":["Mathematical optimization--Computer programs","Nonlinear programming","Integer programming"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright is held by the author. Presentation of this material on the Libraries' web site by University Libraries, The University of Texas at Austin was made possible under a limited license grant from the author who has retained all copyrights in the works."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["b59974023"]},{"key":"dc:identifier.oclc","label":"OCLC","values":["61503058"]},{"key":"dc:identifier.proquest","label":"Dc Identifier Proquest","values":["3055256"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/2152/1663"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["text"]},{"key":"dc:description.abstract","label":"Abstract","values":["Economical, managerial, engineering, and natural systems are often represented by nonlinear equations and inequalities, using discrete and continuous variables. Global Optimization provides methodologies to find the global solutions for the prescriptive models that attempt to describe, predict, and optimize their behavior. OQGRG, the algorithm presented in this dissertation, was developed to solve problems in this large target class of mixed integer, nonlinear, constrained optimization models that often have multiple local optima. OQGRG is a multi-start, 2-stage, global optimization algorithm that combines the efficiency of the Scatter Search meta-heuristic and the power of a reduced gradient nonlinear solver. It uses OptQuest as the implementation of Scatter Search and Lsgrg2 as a nonlinear local solver. OQGRG is written in standard ANSI C, and a GAMS interface provides access to many test problems available in the literature. The effectiveness of the algorithm is demonstrated by solving 155 of 159 test problems within 1% of their best known solutions."]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["electronic"]},{"key":"dc:title","label":"Title","values":["OQGRG: a multi-start algorithm for global solution of nonlinear and mixed integer programs"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Lasdon, Leon S."],"dc:contributor.department":["Business Administration"],"dc:creator":["Ugray, Zsolt Gyula"],"dc:date.accessioned":["2008-08-28T22:10:47Z"],"dc:date.available":["2008-08-28T22:10:47Z"],"dc:date.issued":["2001"],"dc:description":["text"],"dc:description.abstract":["Economical, managerial, engineering, and natural systems are often represented by nonlinear equations and inequalities, using discrete and continuous variables. Global Optimization provides methodologies to find the global solutions for the prescriptive models that attempt to describe, predict, and optimize their behavior. OQGRG, the algorithm presented in this dissertation, was developed to solve problems in this large target class of mixed integer, nonlinear, constrained optimization models that often have multiple local optima. OQGRG is a multi-start, 2-stage, global optimization algorithm that combines the efficiency of the Scatter Search meta-heuristic and the power of a reduced gradient nonlinear solver. It uses OptQuest as the implementation of Scatter Search and Lsgrg2 as a nonlinear local solver. OQGRG is written in standard ANSI C, and a GAMS interface provides access to many test problems available in the literature. The effectiveness of the algorithm is demonstrated by solving 155 of 159 test problems within 1% of their best known solutions."],"dc:format.medium":["electronic"],"dc:identifier":["b59974023"],"dc:identifier.oclc":["61503058"],"dc:identifier.proquest":["3055256"],"dc:identifier.uri":["http://hdl.handle.net/2152/1663"],"dc:language.iso":["eng"],"dc:rights":["Copyright is held by the author. Presentation of this material on the Libraries' web site by University Libraries, The University of Texas at Austin was made possible under a limited license grant from the author who has retained all copyrights in the works."],"dc:subject.lcsh":["Mathematical optimization--Computer programs","Nonlinear programming","Integer programming"],"dc:title":["OQGRG: a multi-start algorithm for global solution of nonlinear and mixed integer programs"],"dc:type":["Thesis"],"others:access_status":["open.access"],"thesis:degree_department":["Business Administration"],"thesis:degree_discipline":["Business Administration"],"thesis:degree_level":["Doctoral"],"thesis:degree_name":["Doctor of Philosophy"],"thesis:institution_name":["The University of Texas at Austin"]},"updated_at":"2026-11-20T21:52:05Z"}