Duality in linear optimization in Sage (math)
Supervisor
Suitable for
Abstract
Description: Duality of a linear programming problem (LP) is an important tool, allowing in particular to compute infeasibilty (aka Farkas) certificates. Sage (http://www.sagemath.org) has LP solving capabilities, but lacks the capability to compute LP duals and infeasibility. The project will implement these and contribute the implementation to Sage. There might be a possibility for participation in Google Summer of Code (GSoC) with Sage as a GSoC organisation.
Prerequisites: Interest in open source software, some knowledge of Python, appropriate
maths background.