Skip to content

This is a Julia implementation of the primal-dual interior-point method for solving linear programming problem.

Notifications You must be signed in to change notification settings

dlguo/primal-dual-interior-point

Repository files navigation

Primal-dual Interior-point Solver for Linear Programming

This is a course project for CS520: Computational Methods for Optimization collaborated with Xin Ye. The complete algorithms and experimental result are in the report.

Features

  • Julia implementation

  • Presolve stage

  • Mehrotra's predictor-corrector algorithm

Requirements

Usage

git clone https://github.com/dlguo/primal-dual-interior-point.git
cd primal-dual-interior-point
julia test.jl

In the interactive interface, choose 9 preset test problem in LPnetlib or use your own dataset.

About

This is a Julia implementation of the primal-dual interior-point method for solving linear programming problem.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages