Knapsack problem by Hanan Kavitz

A well known combinatorial problem (knapsack problem, optimization, linear programming)

knapsackGA

Minimum Perfect Matching Tool by Vojtech Knyttl

Function to solve the Minimum Perfect Matching Problem on non-biparite graphs. (optimization, linear programming, graphs)

min_perfect_matching( G )

GuroboMATic by Kostas Katrinis

GuroboMATic is an open-source software module that interfaces MATLAB with the Gurobi Optimizer. (optimization, mathematical programm..., linear programming)

gurobiSolveMIP(localfilename,tolerance,parameterfilename)

MPS format exporting tool by Bruno Luong

Convert linear programming problem (MATLAB matrices) to MPS format (integer programming, mps, linear programming)

OK=SaveMPS(filename, Contain)

[Contain OK]=BuildMPS(A, b, Aeq, beq, cost, L, U, PbName, v...

Revised Simplex Method. by Bapi Chatterjee

The function revised solves an LPP using revised simplex method. It uses big M method. (big m, simplex, linear programming)

revised(c,b,a,inq,minimize)

Linear Mixed Integer Program Solver by Thomas Trötscher

Solve linear mixed integer problems with a branch and bound method. (linear mixed integer ..., mip, mixed integer linear ...)

lpr(c,A,b,Aeq,beq,e,s,d,yidx,sol,opts)

mipoptions()

miprog(c,A,b,Aeq,beq,lb,ub,yidx,o)

Extract solution from CPLEX .sol file by Thomas Trötscher

Reads a CPLEX .sol xml file and extracts the solution. (cplex, data import, optimization)

read_cplexsol(solfile)

plot_feasible.m by Matthew Roughan

plot_feasible.m is a simple bit of code for visualizing 2D linear programming problems. (linear programming, hatch, hatching)

[sorted_vertices, ...

plot_feasible_test.m

mixed-integer LP by Sherif Tawfik

This function solves the mixed integer linear programming problems. (branch and bound, general integer linea..., mixed integer)

[x,val,status]=IP1(f,A,b,Aeq,beq,lb,ub,M,e)

DEA Solver light by Alvimar Lucena

Educational solver to DEA. (data envelopment anal..., linear programming, optimization)

DEACRSEI(X,Y);

DEACRSEO(X,Y);

DEACRSMI(X,Y);

linprog by Jeff Stuart

suite of files for performing the standard two phase simplex method on linear programming problems. (optimization, linear, lp)

[wmax,ibasic,PHIiter]=phasei(A,b)

[z,xbasic,ibasic,ienter,iter,PCOL,OPTEST,CYCTEST]=phaseii(A...

[zmax,PHIiter,PHIIiter,xbasic,ibasic]=linprog(A,b,c);