Difference: MathematicalProgramming (1 vs. 12)

Revision 122008-05-07 - MichaelOSullivan

Line: 1 to 1
 
META TOPICPARENT name="WebHome"
<-- Ready to Review - done - Lauren-->

Mathematical Programming

Line: 22 to 22
 For more information about formulating and solving a mathematical programme see the topics for the specific types of mathematical programme:
Added:
>
>
 
Deleted:
<
<
  -- TWikiAdminGroup - 20 Feb 2008 \ No newline at end of file

Revision 112008-05-06 - MichaelOSullivan

Line: 1 to 1
 
META TOPICPARENT name="WebHome"
<-- Ready to Review - done - Lauren-->

Mathematical Programming

Line: 24 to 24
 
Added:
>
>
  -- TWikiAdminGroup - 20 Feb 2008 \ No newline at end of file

Revision 102008-04-22 - TWikiAdminUser

Line: 1 to 1
 
META TOPICPARENT name="WebHome"
<-- Ready to Review - done - Lauren-->

Mathematical Programming

Line: 23 to 23
 
Added:
>
>
  -- TWikiAdminGroup - 20 Feb 2008 \ No newline at end of file

Revision 92008-04-06 - MichaelOSullivan

Line: 1 to 1
Changed:
<
<
META TOPICPARENT name="Trash.OpsRes_ForumWebHome"
>
>
META TOPICPARENT name="WebHome"
 
<-- Ready to Review - done - Lauren-->

Mathematical Programming

Revision 82008-03-17 - TWikiAdminUser

Line: 1 to 1
Changed:
<
<
META TOPICPARENT name="WebHome"
>
>
META TOPICPARENT name="Trash.OpsRes_ForumWebHome"
 
<-- Ready to Review - done - Lauren-->

Mathematical Programming

Revision 72008-03-11 - TWikiAdminUser

Line: 1 to 1
 
META TOPICPARENT name="WebHome"
<-- Ready to Review - done - Lauren-->

Mathematical Programming

Line: 15 to 15
 

Solving a Mathematical Programme

Changed:
<
<
For relatively simple or well understood problems the mathematical programme can often be solved to optimality (i.e., the best possible solution is identified) using algorithms such as the Revised Simplex Method, interior point methods, or branch-and-bound. However, some industrial problems would take too long to solve to optimality using these classical optimisation techniques. Often these problems are solved using heuristic methods (such as Tabu search and Simulated Annealing) which do not guarantee optimality. The best solution method for a mathematical programme is highly dependent of do you mean "on" ??? - Lauren the type of mathematical programme being solved.
>
>
For relatively simple or well understood problems the mathematical programme can often be solved to optimality (i.e., the best possible solution is identified) using algorithms such as the Revised Simplex Method, interior point methods, or branch-and-bound. However, some industrial problems would take too long to solve to optimality using these classical optimisation techniques. Often these problems are solved using heuristic methods (such as Tabu search and Simulated Annealing) which do not guarantee optimality. The best solution method for a mathematical programme is highly dependent on the type of mathematical programme being solved.
 

Types of Mathematical Programme

For more information about formulating and solving a mathematical programme see the topics for the specific types of mathematical programme:

Changed:
<
<
>
>
  -- TWikiAdminGroup - 20 Feb 2008 \ No newline at end of file

Revision 62008-03-09 - LaurenJackson

Line: 1 to 1
 
META TOPICPARENT name="WebHome"
Changed:
<
<
<-- Ready to Review -->
>
>
<-- Ready to Review - done - Lauren-->
 

Mathematical Programming

Mathematical programming uses mathematical variables and expressions to model problems. In the formulation step of the Operations Research (OR) methodology we identify the key quantifiable decisions, restrictions and goals from the problem description, and capture their interdependencies in a mathematical programming model also known as a mathematical programme.

Revision 52008-03-09 - LaurenJackson

Line: 1 to 1
 
META TOPICPARENT name="WebHome"
<-- Ready to Review -->

Mathematical Programming

Line: 22 to 22
 For more information about formulating and solving a mathematical programme see the topics for the specific types of mathematical programme:
Changed:
<
<
>
>
  -- TWikiAdminGroup - 20 Feb 2008 \ No newline at end of file

Revision 42008-03-09 - LaurenJackson

Line: 1 to 1
 
META TOPICPARENT name="WebHome"
<-- Ready to Review -->

Mathematical Programming

Line: 8 to 8
 

Formulating a Mathematical Programme

We can break the formulation process into 4 key steps:

Changed:
<
<
  1. Identify the Decision Variables paying particular attention to units (for example: we need to decide how many hours per week each process will run for).
  2. Formulate the Objective Function using the decision variables, we can construct a minimise or maximise objective function. The objective function typically reflects the total cost, or total profit, for a given value of the decision variables.
  3. Formulate the Constraints, either logical (for example, we cannot work for a negative number of hours), or explicit to the problem description. Again, the constraints are expressed in terms of the decision variables.
  4. Identify the Data needed for the objective function and constraints. To solve your mathematical programme you will need to have some "hard numbers" as variable bounds and/or variable coefficients in your objective function and/or constraints.
>
>
  1. Identify the Decision Variables paying particular attention to units (for example: we need to decide how many hours per week each process will run for).
  2. Formulate the Objective Function using the decision variables, we can construct a minimise or maximise objective function. The objective function typically reflects the total cost, or total profit, for a given value of the decision variables.
  3. Formulate the Constraints, either logical (for example, we cannot work for a negative number of hours), or explicit to the problem description. Again, the constraints are expressed in terms of the decision variables.
  4. Identify the Data needed for the objective function and constraints. To solve your mathematical programme you will need to have some "hard numbers" as variable bounds and/or variable coefficients in your objective function and/or constraints.
 

Solving a Mathematical Programme

Changed:
<
<
For relatively simple or well understood problems the mathematical programme can often be solved to optimality (i.e., the best possible solution is identified) using algorithms such as the Revised Simplex Method, interior point methods, or branch-and-bound. However, some industrial problems would take too long to solve to optimality using these classical optimisation techniques. Often these problems are solved using heuristic methods (such as Tabu search and Simulated Annealing) which do not guarantee optimality. The best solution method for a mathematical programme is highly dependent of the type of mathematical programme being solved.
>
>
For relatively simple or well understood problems the mathematical programme can often be solved to optimality (i.e., the best possible solution is identified) using algorithms such as the Revised Simplex Method, interior point methods, or branch-and-bound. However, some industrial problems would take too long to solve to optimality using these classical optimisation techniques. Often these problems are solved using heuristic methods (such as Tabu search and Simulated Annealing) which do not guarantee optimality. The best solution method for a mathematical programme is highly dependent of do you mean "on" ??? - Lauren the type of mathematical programme being solved.
 

Types of Mathematical Programme

Revision 32008-03-04 - MichaelOSullivan

Line: 1 to 1
 
META TOPICPARENT name="WebHome"
<-- Ready to Review -->

Mathematical Programming

Revision 22008-02-21 - MichaelOSullivan

Line: 1 to 1
 
META TOPICPARENT name="WebHome"
Added:
>
>
<-- Ready to Review -->
 

Mathematical Programming

Mathematical programming uses mathematical variables and expressions to model problems. In the formulation step of the Operations Research (OR) methodology we identify the key quantifiable decisions, restrictions and goals from the problem description, and capture their interdependencies in a mathematical programming model also known as a mathematical programme.

Revision 12008-02-20 - TWikiAdminUser

Line: 1 to 1
Added:
>
>
META TOPICPARENT name="WebHome"

Mathematical Programming

Mathematical programming uses mathematical variables and expressions to model problems. In the formulation step of the Operations Research (OR) methodology we identify the key quantifiable decisions, restrictions and goals from the problem description, and capture their interdependencies in a mathematical programming model also known as a mathematical programme.

Formulating a Mathematical Programme

We can break the formulation process into 4 key steps:

  1. Identify the Decision Variables paying particular attention to units (for example: we need to decide how many hours per week each process will run for).
  2. Formulate the Objective Function using the decision variables, we can construct a minimise or maximise objective function. The objective function typically reflects the total cost, or total profit, for a given value of the decision variables.
  3. Formulate the Constraints, either logical (for example, we cannot work for a negative number of hours), or explicit to the problem description. Again, the constraints are expressed in terms of the decision variables.
  4. Identify the Data needed for the objective function and constraints. To solve your mathematical programme you will need to have some "hard numbers" as variable bounds and/or variable coefficients in your objective function and/or constraints.

Solving a Mathematical Programme

For relatively simple or well understood problems the mathematical programme can often be solved to optimality (i.e., the best possible solution is identified) using algorithms such as the Revised Simplex Method, interior point methods, or branch-and-bound. However, some industrial problems would take too long to solve to optimality using these classical optimisation techniques. Often these problems are solved using heuristic methods (such as Tabu search and Simulated Annealing) which do not guarantee optimality. The best solution method for a mathematical programme is highly dependent of the type of mathematical programme being solved.

Types of Mathematical Programme

For more information about formulating and solving a mathematical programme see the topics for the specific types of mathematical programme:

-- TWikiAdminGroup - 20 Feb 2008

 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2020 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback