Sitemap
Explore all pages and tools on OR Solver
Main Pages
Linear Programming
Optimization solvers for linear programming problems
Network Optimization
Tools for solving network flow and routing problems
Operations Research
Classical OR problems and methodologies
Queue Problem
M/M/1 and M/M/c models
PERT/CPM Analysis
Project scheduling & critical path
Game Theory
Zero-sum games & mixed strategies
Decision Analysis
EMV, EVPI & decision criteria
0/1 Knapsack
Dynamic programming knapsack
Johnson's Rule
2-machine job sequencing
AHP
Analytic hierarchy process
Learning Curve
Wright learning curve
Equipment Replacement
Economic life analysis
Markov Chains
Steady-state probabilities
Monte Carlo
Risk simulation
Project Crashing
CPM time-cost tradeoff
Hypothesis & ANOVA
t-tests and one-way ANOVA
Business Analytics
Financial and business analysis calculators
Economic Order Quantity
Inventory optimization
Economic Production Quantity
Finite replenishment lot size
Breakeven Analysis
Cost-volume-profit analysis
Portfolio Analysis
Risk-return & diversification
Inventory Control
Multiple inventory techniques
Profit Margin
Margin & markup calculator
Financial Ratios
Ratio analysis
Cash Flow Forecast
Cash flow projection
Loan / EMI
Loan calculator
Inventory Turnover
Stock turnover ratio
Depreciation
Asset depreciation
Compound Interest
Future value calculator
NPV & IRR
Discounted cash flow analysis
WACC
Weighted average cost of capital
Forecasting
Moving average & smoothing
Blog Articles
Educational articles and guides on Operations Research topics
Understanding Linear Programming: A Complete Guide
Learn the fundamentals of linear programming, from basic concepts to advanced optimization techniques used in business and operations research.
The Simplex Method: Step-by-Step Explanation
Dive deep into the simplex method algorithm, understand how it works, and learn to apply it to solve linear programming problems efficiently.
Transportation Problem: Optimization in Logistics
Explore how the transportation problem helps minimize shipping costs while meeting supply and demand requirements in logistics and distribution networks.
Assignment Problem: Optimal Job Matching
Master the assignment problem to efficiently allocate tasks to workers, minimize costs, and optimize resource utilization in business operations.
Economic Order Quantity (EOQ): Optimizing Inventory Costs
Learn how the EOQ model helps businesses minimize total inventory costs by finding the optimal order quantity that balances ordering and holding costs.
Financial Ratios: A Comprehensive Guide to Business Analysis
Discover how financial ratios help analyze a company's performance, liquidity, profitability, and efficiency to make informed business decisions.
Compound Interest: The Power of Exponential Growth
Understand how compound interest works, why it's called the eighth wonder of the world, and how to leverage it for wealth building and financial planning.
PERT and CPM: Project Scheduling and Management
Learn how Program Evaluation and Review Technique (PERT) and Critical Path Method (CPM) help manage complex projects, identify critical activities, and optimize project timelines.
Portfolio Optimization: Balancing Risk and Return
Explore modern portfolio theory, learn how to optimize investment portfolios, and understand the relationship between risk and return in financial decision-making.
Breakeven Analysis: Understanding Cost-Volume-Profit Relationships
Master breakeven analysis to determine sales volumes needed to cover costs, understand profitability thresholds, and make informed pricing and production decisions.
Queue Theory: Managing Waiting Lines and Service Systems
Discover how queue theory helps optimize service systems, reduce waiting times, and improve customer satisfaction in various industries from healthcare to telecommunications.
Shortest Path Problem: Route Optimization in Networks
Learn how shortest path algorithms find optimal routes in networks, from GPS navigation to network routing, and discover applications in logistics and operations.
Integer Programming: Discrete Optimization Solutions
Explore integer programming, a powerful optimization technique for problems requiring discrete decisions, from facility location to production planning with binary and integer variables.
How to Calculate Standard Deviation (Step-by-Step with Examples)
A clear, worked guide to calculating standard deviation by hand — including the difference between sample and population standard deviation, variance, and when to use each.
Linear Regression Explained: Line of Best Fit, r, and R²
Learn how to find the least-squares regression line by hand, interpret the correlation coefficient (r) and R², and make predictions — with a fully worked example.
How to Calculate a Z-Score and Find Probabilities
Understand what a z-score is, how to calculate it, and how to convert it into a probability or percentile using the normal distribution — with worked examples.
The Simplex Method: A Step-by-Step Worked Example
Learn how the Simplex method solves linear programming problems, with a complete worked example showing slack variables, the tableau, pivoting, and reading the optimal solution.
Transportation Problem: North-West Corner and MODI Method Explained
A step-by-step guide to solving the transportation problem — building an initial feasible solution with the North-West Corner method and optimizing it with MODI.
Economic Order Quantity (EOQ): Formula, Example, and Reorder Point
Learn the EOQ formula, work through a complete inventory example, and see how to calculate the reorder point to minimize total inventory cost.
PERT and CPM: How to Find the Critical Path (Worked Example)
Understand PERT and CPM project scheduling: compute expected activity times, run the forward and backward pass, find slack, and identify the critical path.
LP Toolkit: Simplex, Graphical, Integer, and Duality
How Solver360’s linear programming tools fit together — when to use Simplex vs graphical method, when integers matter, and how dual variables become shadow prices.
The Assignment Problem: Hungarian Method Step by Step
Learn how the Hungarian algorithm finds the minimum-cost one-to-one assignment of workers to jobs, with a fully worked example including row/column reduction and line covering.
Queuing Theory: The M/M/1 Model Explained with Examples
Understand the M/M/1 single-server queue: arrival and service rates, utilization, and how to calculate the average number and time in the system and queue.
NPV vs IRR: How to Evaluate an Investment (Worked Example)
Understand Net Present Value and Internal Rate of Return, how they differ, when they disagree, and how to use both to make capital-budgeting decisions.
Break-Even Analysis: Formula, Example, and Target Profit
Learn how to calculate the break-even point in units and revenue, understand the contribution margin, and find the sales needed to hit a target profit.
Game Theory Basics: Saddle Points and Mixed Strategies
Learn how to solve two-person zero-sum games — finding a pure-strategy saddle point and computing optimal mixed strategies and the value of the game.
Decision Analysis: EMV, EVPI, and Decision Criteria Explained
Learn to make decisions under risk and uncertainty using Expected Monetary Value, EVPI, and the Maximax, Maximin, Hurwicz, Laplace, and Minimax Regret criteria.
Forecasting Methods: Moving Average vs Exponential Smoothing
Compare the main time-series forecasting methods — moving average, weighted moving average, exponential smoothing, and linear trend — and learn to measure accuracy with MAD, MSE, and MAPE.
Compound Interest and the Time Value of Money Explained
Understand compound interest, future value, compounding frequency, and the effective annual rate — with worked examples and the difference from simple interest.
Inventory Control: ABC Analysis, Safety Stock, and Reorder Point
A practical guide to inventory management: classify items with ABC analysis, calculate safety stock for a service level, and set the reorder point.
Legal & Policies
XML Sitemap
For search engines: View XML Sitemap