Linprog: Linear Programming

Linprog solves linear programming and optimization problems step by step — and shows the complete worked solution, not just the final answer.

From a classic simplex tableau to the travelling salesman problem, it covers the operations research methods you actually study, and works fully offline.

Whether you're a student checking coursework or solving a problem set, Linprog walks through each method in full, saves your work so you can revisit it, and presents results as exact fractions or decimals.

OPERATIONS

• Simplex method calculator
• Dual simplex method calculator
• Transportation problem — potential method calculator
• Assignment problem — Hungarian method calculator
• Travelling salesman problem calculator (TSP)
• Game theory calculator
• Dynamic programming calculator

LINEAR PROGRAMMING Maximize or minimize a linear objective function under linear constraints. Linprog handles the full setup — objective, constraints, and bounds — and shows every pivot of the simplex (and dual simplex) algorithm so you can follow exactly how the optimum is reached.

FEATURES

• Full step-by-step solutions for every method
• Custom keyboard for fast, convenient data entry
• Save and edit your solutions
• Works without an internet connection
• Results as ordinary or decimal fractions

Web version: https://linprog.com