Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

Simon Fraser University

$28,000.00

Algorithms for some hard discrete nonlinear optimization problems and applications

EF 2015-16

Résumé
The primary objective of the proposed research program is to develop efficient algorithms for solving fundamental hard discrete optimization <span style=""line-height: 1.5em;"">problems with applications in the areas of production, planning, distribution, scheduling, communication etc.<span style=""line-height: 1.5em;""> An equally important objective is to train highly qualified graduate and <span style=""line-height: 1.5em;"">undergraduate students and postdoctoral <span style=""line-height: 1.5em;"">fellows who could apply cutting-edge algorithmic and modeling techniques to solve <span style=""line-height: 1.5em;"">complex optimization projects and develop viable alternative solution approaches that improve solution quality <span style=""line-height: 1.5em;"">and running time. Dissemination of research results through conference presentations and publications in reputable <span style=""line-height: 1.5em;"">journals are also part of the objectives. Accomplishment of these objectives necessitate development of new theoretical results, intelligent application of existing <span style=""line-height: 1.5em;"">results, development of computer programs, and extensive experimental and theoretical analysis of algorithms. This <span style=""line-height: 1.5em;"">investigator's research experience and results obtained in the past will be very useful in completing the <span style=""line-height: 1.5em;"">project. In particular, domination analysis of heuristics and very large scale neighborhood search techniques developed <span style=""line-height: 1.5em;"">by our research group and others will be vital algorithm design tools in the research project. <span style=""line-height: 1.5em;"">The proposed research work includes, among others, solving large scale discrete optimization problems with nonlinear <span style=""line-height: 1.5em;"">objective functions. Special emphasis will be given to quadratic, bilinear, and fractional objectives and applications where feasible<span style=""line-height: 1.5em;""> solutions are special graph theoretic structures and/or <span style=""line-height: 1.5em;"">discrete points within polyhedral sets. Variations of the binary quadratic programming problem, algorithms that uses fixed size unconstrained binary quadratic programs within a quantum computing-like framework, enhancements to variable neighborhood search algorithms, analysis of algorithms for 0-1 fractional programming problems involving ratios of linear or quadratic functions are some of the specific topics considered in this project. <span style=""line-height: 1.5em;""> We will also investigate more general nonlinear integer programs, a class of discrete optimization <span style=""line-height: 1.5em;"">problems that has considerable modeling flexibility, yet relatively little algorithmic advancements have been reported in <span style=""line-height: 1.5em;"">literature. The research is expected to result in novel solution approaches for problems of interest hitherto unsolved or for  <span style=""line-height: 1.5em;"">solving problems more efficiently and thereby making fundamental contributions to optimization modeling and solution <span style=""line-height: 1.5em;"">approaches that harness theoretical and applied research. The outcome of the research work is expected to enhance the efficacy and uses of operations research <span style=""line-height: 1.5em;"">methodologies for socioeconomic <span style=""line-height: 1.5em;"">developments within Canada and abroad. Further, g<span style=""line-height: 1.5em;"">raduate and undergraduate students and postdoctoral <span style=""line-height: 1.5em;"">fellows employed in the project <span style=""line-height: 1.5em;"">will receive valuable research training in operations research.
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
RGPIN-2015-06342
Name nom
Punnen, Abraham
Department département
Mathematics - Mathematics
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2015
Award amount
28000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1509
Committee name en
Civil, Industrial and Systems Engineering
Committee name fr
Génie civil, industriel et des systèmes
Area of application code
520
Area of application group en
Manufacturing processes and products
Area of application group fr
Procédés et produits industriels
Area of application en
Production and operations management
Area of application fr
Production et gestion des opérations
Research subject code
1601
Research subject group en
Industrial engineering
Research subject group fr
Génie industriel
Research subject en
Operations research and management science
Research subject fr
Recherche opérationnelle et science de la gestion
Partie
1
Nb partie
5
Application title
Algorithms for some hard discrete nonlinear optimization problems and applications
Keyword
NSERC
Application summary
<p>The primary objective of the proposed research program is to develop efficient algorithms for solving fundamental hard discrete optimization <span style=""line-height: 1.5em;"">problems with applications in the areas of production, planning, distribution, scheduling, communication etc.</span><span style=""line-height: 1.5em;""> An equally important objective is to train highly qualified graduate and </span><span style=""line-height: 1.5em;"">undergraduate students and postdoctoral </span><span style=""line-height: 1.5em;"">fellows who could apply </span>cutting-edge algorithmic and modeling techniques to solve <span style=""line-height: 1.5em;"">complex optimization projects and develop viable alternative solution approaches that improve solution quality </span><span style=""line-height: 1.5em;"">and running time. Dissemination of research results through conference presentations and publications in reputable </span><span style=""line-height: 1.5em;"">journals are also part of the objectives.</span></p> <p>Accomplishment of these objectives necessitate development of new theoretical results, intelligent application of existing <span style=""line-height: 1.5em;"">results, development of computer programs, and extensive experimental and theoretical analysis of algorithms. This </span><span style=""line-height: 1.5em;"">investigator's research experience and results obtained in the past will be very useful in completing the </span><span style=""line-height: 1.5em;"">project. In particular, domination analysis of heuristics and very large scale neighborhood search techniques developed </span><span style=""line-height: 1.5em;"">by our research group and others will be vital algorithm design tools in the research project. </span><span style=""line-height: 1.5em;"">The proposed research work includes, among others, solving large scale discrete optimization problems with nonlinear </span><span style=""line-height: 1.5em;"">objective functions. Special emphasis will be given to quadratic, bilinear, and fractional objectives and applications where feasible</span><span style=""line-height: 1.5em;""> solutions are special graph theoretic structures and/or </span><span style=""line-height: 1.5em;"">discrete points within polyhedral sets. Variations of the binary quadratic programming problem, algorithms that uses fixed size unconstrained binary quadratic programs within a quantum computing-like framework, enhancements to variable neighborhood search algorithms, analysis of algorithms for 0-1 fractional programming problems involving ratios of linear or quadratic functions are some of the specific topics considered in this project. </span><span style=""line-height: 1.5em;""> We will also investigate more general nonlinear integer programs, a class of discrete optimization </span><span style=""line-height: 1.5em;"">problems that has considerable modeling flexibility, yet relatively little algorithmic advancements have been reported in </span><span style=""line-height: 1.5em;"">literature.</span></p> <p>The research is expected to result in novel solution approaches for problems of interest hitherto unsolved or for  <span style=""line-height: 1.5em;"">solving problems more efficiently and thereby making fundamental contributions to optimization modeling and solution </span><span style=""line-height: 1.5em;"">approaches that harness theoretical and applied research. The outcome of the research work is expected to enhance the efficacy and uses of operations research </span><span style=""line-height: 1.5em;"">methodologies for socioeconomic </span><span style=""line-height: 1.5em;"">developments within Canada and abroad. Further, g</span><span style=""line-height: 1.5em;"">raduate and undergraduate students and postdoctoral </span><span style=""line-height: 1.5em;"">fellows employed in the project </span><span style=""line-height: 1.5em;"">will receive valuable research training in operations research.</span></p>