Skip to content

LinearProgramming

Jump to bottom
Branden Stone edited this page May 8, 2016 · 3 revisions

LinearProgramming Package

The goal of the package is to implement linear programing methods such as the simplex method in M2. The GitHub repository for the package is located at https://github.com/b-stone/LinearProgramming-M2.

Group members:

  • Tom Enkosky
  • Branden Stone

Workshop Goals

Simplex Method

  1. Create a method that runs the simplex method;
  2. Determine user input
  3. Determine output
  4. create options that allow for max or min

Enumerate Vertices

  1. Determine best algorithm to enumerate vertices of feasible area.
Clone this wiki locally