Jay-Naik2526

Activity

Stars and mentions · Last 30 days, Oct 7 – Nov 5

GitHub stars0
Mentions1
01234Oct 7Oct 21Nov 5
UTC days · repositories Jay-Naik2526 owns0 repositories

Top repositories

Jay-Naik2526’s repositories ranked by pull request authors, as on trending.

Loading

Contributes to

Repositories outside Jay-Naik2526’s account where Jay-Naik2526 opened or reviewed pull requests in the past 365 days.

Who noticed Jay-Naik2526

Everyone who starred or forked Jay-Naik2526’s repositories since the archive began in 2011.

Notable accounts

Ordered by the stars their own repositories have received.

Biggest fans

Accounts that starred the most of these repositories.

Breakout weeks

Each repository’s best week of new stars, with the release published around it.

Mentions

1post
Nov 60 posts
  1. I built a free, offline replacement for TORA that explains every simplex step For our Operations Research course at NMIMS Shirpur, my teammates and I wanted a tool that shows why each simplex step happens, not only the final answer. So I built OR/Studio: a free, open-source Operations Research workbench that runs in the browser and works offline. !A real solve, stepped through What it does There are 13 solver modules: simplex (including Big-M, two-phase and dual), integer programming, nonlinear programming, transportation, assignment, network models, project planning, queuing, inventory, game theory, Markov chains, simulation and job sequencing. Every tableau and ratio test comes with a plain-language reason and the rule that was applied. In tutor mode you pick the entering variable and leaving row yourself and get told what went wrong if you're off. In diff mode you type your own working and it finds the first step where you diverged. Exact arithmetic Fractions are exact, so the numbers in a tableau match what you'd get by hand. Big-M and prohibited routes use a symbolic M, never a large number. How I tested it The solvers are pure TypeScript with no UI dependency, and I tested them against independent checks, not against themselves: - Linear programs against vertex enumeration and strong-duality checks on random instances. - Integer programs and assignment against brute force. - Transportation, max flow and games re-formulated as LPs and compared. - Shortest-path and spanning-tree algorithms that must agree with each other. The repo has 452 tests. The hardest part wasn't the algorithms. It was the edge cases: unbounded problems, cycling, degenerate pivots and negative cycles. What it doesn't do yet Separable programming isn't implemented, "Save as PDF" goes through the browser's print dialog, and the nonlinear module works in floating point. I've opened these as issues. Try it - Live: or-studio.antideploy.app - Code (MIT): Jay-Naik2526/or-studio I'd like feedback from anyone taking or teaching an OR course, especially bugs and missing methods.

Achievements

Awards earned by the repositories Jay-Naik2526 owns. Select an award to embed its badge.

No awards yet

Repositories earn awards by reaching the top three in a completed trending day or week.

A repository earns an award for finishing first, second or third in a completed trending day or week, ranked by new stars, new forks or pull request authors. Awards follow a repository through renames and transfers and count toward its current owner. Weeks run Monday to Sunday, UTC.