- Examination results.
**Get in touch with your supervisors to start your projects!**- Since there are few projects and many people left, projects that have teams consisting of one person only may be re-chosen.
- 15/2/08:
**DEADLINE**for project submission - 20/12/07:
**DEADLINE**for choosing a project - 13/12/07: Projet 9 (LCP) was taken by Marcel Kinengue et Mounir Chahid
- Lab class 13/12/07: knp.mod, multistart.run
- Deadline for
*deciding*project and group: 20/12/07 - 13/12/07: Project 1 (separation network) was taken by Tanja and Sergio
- REMINDER: the projects are
**exclusive**(only one group can choose a project, which means that "first come, first served") - The list of projects for the exam.
**Deadline: 15/2/08**. - haverly.dat
- AMPL modelling exercise: modify the
*diet problem*to ensure that the optimal diet always has at least 5 types of foods - The exam format is by project (groups of 2-3 people)
- Leo Liberti (Office: LIX 412-29 prefab, tel. 4138)
- Ruslan Sadykov: sadykov [@] lix [point] polytechnique [point] fr
- Giacomo Nannicini
- Slides for lecture 1: Optimization on Graphs
- Exercises and solutions for lecture 1
- Slides for lectures 2 and 5: Linear programming and Duality
- Slides for lecture 3: Integer Programming
- Slides for lecture 4: Shortest paths
- Slides for lecture 6 and 8: Nonlinear Programming
- Slides for lecture 7: Constraint Programming
- The exercise book
- Solutions to "Easy Modelling Problems" chapter in the exercise book
- Solutions to all exercises
- Solutions to exercise in lecture 3
- AMPL is
*A**M*athematical*P*rogramming*L*anguage. Optimization problems coded in AMPL look very close to their corresponding mathematical formulation. - Each problem instance is coded in AMPL using three files: a model
file (extension
`.mod`), a data file (extension`.dat`) and a run file (extension`.run`). - The model file contains the mathematical formulation of the problem.
- The data file contains the numerical values of the problem parameters. Different data files for the same model file correspond to different instances of the same optimization problem.
- The run file specifies the solution algorithm. This may be implemented in an external numerical solver, such as CPLEX, or coded by the user in the AMPL language itself. We will often use a combination of the two.
- The student edition of AMPL can be downloaded here for either UNIX or Windows platforms. Download and install, from the same webpage, the solvers CPLEX, MINOS, and SNOPT, too.
- AMPL, CPLEX, MINOS and SNOPT student editions are already installed in the computer labs.
- Graph theory entry in Wikipedia
- Prim's algorithm entry in Wikipedia
- Dijkstra's algorithm entry in Wikipedia
- The AMPL website
- The first 2 chapters of the AMPL book
- An AMPL tutorial

Problem Name |
Team |
Supervisor |
Material |
---|---|---|---|

Separation network planning |
Prosvirnova + Rivas | Introductory material | |

MINLP solution methods |
|||

Modelling cellular automata |
Pharwaha + Albarran | Introductory material | |

A didactical implementation of the simplex method |
|||

Improving UML class diagrams |
Brahim + Bendahou | Introductory material | |

Eternity II puzzle |
Foessel | Introductory material | |

Minimum Cost Flow problem |
Jouai | Introductory material | |

Resource Constrained Project Scheduling Problem |
Crosthwaite + Ferreira | Introductory material | |

Solutions of Linear Complementarity Problems (LCP) |
Kinengue + Chahid + Guillet | Introductory material |

Matos + Lecourtois: proposed project:

(Laura Di Giacomo: *digiacomo [at] lix [point] polytechnique [point] fr*)

071025 thu 08:30-12:30 ISC612 (Optimization on graphs) LL/RS 071031 wed 08:30-12:30 ISC612 (Linear programming I) LL/LL 071108 thu 08:30-12:30 ISC612 (Mixed integer programming) RS/RS 071115 thu 08:30-12:30 ISC612 (Shortest paths algorithms) GN/GN 071122 thu 08:30-12:30 ISC612 (Linear programming II) LL/RS 071129 thu 08:30-12:30 ISC612 (Nonlinear modelling I) LL/LL 071206 thu 08:30-12:30 ISC612 (Constraint programming) RS/RS 071213 thu 08:30-12:30 ISC612 (Nonlinear modelling II) LL/LLEvery slot will be composed by 2 hours lectures (0830-1230) in Salle 72 (Batiment Paul Levy) and two hours of practical exercises in Salle Info 33.