Skip to content

transp-or/optimization_2025

Repository files navigation

Lab Sessions – Guidelines and Schedule

General Guidelines

  • All exercises are provided in pairs of Jupyter notebooks:

    • The questions notebook contains the problem statement and skeleton code.
      → Your task is to complete the missing code.
    • The solutions notebook contains the fully worked-out answers.
  • If you get blocked, consult the solutions.

    • If you are new to Python, you will likely need to do this regularly at first.
    • This is perfectly normal and a good way to learn.
  • You may also consult online resources and AI agents.

    • Use them carefully: the goal is to understand your work.
    • Solving the exercises without comprehension is not useful.
  • Below you will find a suggested organization of topics throughout the semester.

    • This is indicative only.
    • In the first weeks, you may not have time to complete all the suggested material.
    • This is fine — you can return to it later.

Weekly Breakdown

September 12

Python primer / refresher

  • topic_00_python/primer.ipynb
  • topic_00_python/lab01_python_questions.ipynb

Modeling (to be continued next week)

  • topic_01_modeling/lab02_projectile_questions.ipynb
  • topic_01_modeling/lab03_projectile_2_questions.ipynb
  • (if time) topic_01_modeling/lab01_coola_questions.ipynb

September 19

Modeling

  • topic_01_modeling/lab04_kkt_questions.ipynb
  • topic_01_modeling/lab05_standard_form_questions.ipynb
  • topic_01_modeling/lab06_existence_questions.ipynb

Linear constraints (if time)

  • topic_02_linear_optimization/lab01_feasibility_questions.ipynb

September 26 – Linear constraints (to be continued next week)

  • topic_02_linear_optimization/lab02_feasible_directions_questions.ipynb
  • topic_02_linear_optimization/lab03_bases_questions.ipynb
  • topic_02_linear_optimization/lab04_basic_directions_questions.ipynb

October 3

Linear constraints

  • topic_02_linear_optimization/lab05_reduced_costs_questions.ipynb
  • topic_02_linear_optimization/lab06_active_constraints_questions.ipynb
  • topic_02_linear_optimization/lab07_redudant_constraints_questions.ipynb

Simplex algorithm (to be continued next week)

  • topic_03_simplex/lab01_enumeration_questions.ipynb
  • topic_03_simplex/lab02_graphical_questions.ipynb

October 10 (4 periods) – Simplex algorithm

  • topic_03_simplex/lab03_simplex_questions.ipynb
  • topic_03_simplex/lab04_tableau_questions.ipynb
  • topic_03_simplex/lab05_pivoting_questions.ipynb
  • topic_03_simplex/lab07_phase_one_questions.ipynb

Additional exercises

  • topic_03_simplex/lab08_multiple_choice_questions_questions.ipynb
  • topic_03_simplex/lab06_simplex_tableau_questions.ipynb

October 17 – Duality

  • topic_04_duality/lab01_feasibility_questions.ipynb
  • topic_04_duality/lab02_dual_problem_questions.ipynb
  • topic_04_duality/lab03_complementarity_slackness_questions.ipynb

October 24

Mid-term break


October 31

Mock exam


November 7 – Networks

  • topic_05_networks/lab01_network_representation_questions.ipynb
  • topic_05_networks/lab02_flows_divergences_questions.ipynb
  • topic_05_networks/lab03_trees_questions.ipynb

November 14 – Transhipment (to be continued next week)

  • topic_06_transhipment/lab01_total_unimodularity_questions.ipynb
  • topic_06_transhipment/lab02_shortest_path_questions.ipynb
  • topic_06_transhipment/lab03_standard_form_questions.ipynb
  • topic_06_transhipment/lab04_optimality_conditions_questions.ipynb

November 21

Transhipment

  • topic_06_transhipment/lab05_maximum_flow_questions.ipynb
  • topic_06_transhipment/lab06_transportation_questions.ipynb

Additional exercise

  • topic_06_transhipment/lab07_train_tickets_questions.ipynb

Shortest paths (to be continued next week)

  • topic_07_shortest_paths/lab01_generic_algorithm_questions.ipynb
  • topic_07_shortest_paths/lab02_bellman_questions.ipynb

November 28 – Shortest paths

  • topic_07_shortest_paths/lab03_dikstra_algorithm_questions.ipynb
  • topic_07_shortest_paths/lab04_pert_questions.ipynb

December 5 – Discrete optimization (to be continued next week)

  • topic_08_discrete/lab01_branch_and_bound_questions.ipynb
  • topic_08_discrete/lab02_modeling_questions.ipynb
  • topic_08_discrete/lab03_set_covering_questions.ipynb
  • topic_08_discrete/lab04_tsp_questions.ipynb

December 12 (4 periods)

Discrete optimization

  • topic_08_discrete/lab05_relaxation_questions.ipynb

Nonlinear optimization

  • topic_09_nonlinear/lab01_first_wolfe_questions.ipynb
  • topic_09_nonlinear/lab02_second_wolfe_questions.ipynb
  • topic_09_nonlinear/lab03_newton_local_questions.ipynb
  • topic_09_nonlinear/lab04_preconditioning_questions.ipynb
  • topic_09_nonlinear/lab05_validity_questions.ipynb
  • topic_09_nonlinear/lab06_linesearch_questions.ipynb
  • topic_09_nonlinear/lab07_multiple_choice_questions.ipynb

December 19

No class – Catch up at home on exercises you did not complete.


About

Material for the EPFL course MATH-265 "Introduction to optimization and operations research"

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published