← Select an Algorithm

Available Optimization Tools

• Dual Simplex Algorithm

  Solves linear programming problems efficiently with the Dual Simplex method, perfect for modified constraints.

• Two Phase Simplex Solver

  A two-stage Simplex algorithm for complex linear programming problems.

• Graphical Linear Programming Solver

  Visualizes and solves two-variable linear programming problems using graphical methods.

• Goal Penalties Simplex

  Handles multi-objective optimization with penalty-based goal programming.

• Goal Preemptive Simplex

  Prioritizes goals in linear programming with a preemptive Simplex approach.

• Math Preliminaries for Optimization

  Learn foundational optimization basics for understanding linear programming concepts.

• Sensitivity Analysis Tool

  Analyzes changes in linear programming solutions with sensitivity analysis.

• Linear Programming Duality Solver

  Explores dual formulation of linear programming problems.

• Data Envelopment Analysis (DEA) Tool

  Measures efficiency with Data Envelopment Analysis for decision-making units.

• Linear Programming Modeling Tool

  Dynamically add activities and constraints to linear programming models.

• Knapsack Problem Solver

  Solves the knapsack problem using Branch and Bound for optimal selection.

• Branch and Bound Simplex

  Uses Branch and Bound for complex integer programming problems.

• Cutting Plane Optimization

  Refines solutions with cutting plane methods for integer programming.

• Cheapest Insertion TSP Solver

  Solves the Traveling Salesman Problem with the Cheapest Insertion heuristic.

• Nearest Neighbor TSP Solver

  Approximates TSP solutions using the Nearest Neighbor algorithm.

• Hungarian Algorithm Solver

  Solves assignment problems with the Hungarian Algorithm.

• Machine Scheduling Optimization

  Optimizes scheduling for machines in operations research.

• Golden Ratio Search Calculator

  Performs one-dimensional optimization with the Golden Ratio Search.

• Steepest Descent Optimization

  Optimizes functions with the Steepest Descent algorithm for gradient-based solutions.