Skip to content

This is a Python implementation of the primal-dual interior-point method for solving linear, quadratic and lexicographic multi-objective programming problem.

License

Notifications You must be signed in to change notification settings

balditommaso/primal-dual-interior-point

 
 

Repository files navigation

Primal-dual Interior-point Solver

This is a course project for Symbolic and Evolutionary Artificial Intelligence course at the University of Pisa. The aim of the project is to find variant of the Interior Point Method algorithm to solve Lexicographic Multi-Objective Quadratic Programming problems.

Features

  • Python implementation

  • Mehrotra's predictor-corrector algorithm for Linear Programming Problem and Quadratic Programming Problem

  • Two new IPM variant are propsed to solve LMOQP problems.

Usage

  • install the dependencies from requirements.txt
  • run the "test" notebook

About

This is a Python implementation of the primal-dual interior-point method for solving linear, quadratic and lexicographic multi-objective programming problem.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Jupyter Notebook 97.4%
  • Python 2.6%