Features

• Linear optimization routines for solving the following:
  • Linear constrained and unconstrained optimization problems
  • Transportation problems
  • Binary and mixed-integer problems
  • Problems with multiple solutions
  • Simplex diagnostics


• Nonlinear optimization routines for the following methods:
  • Goldstein algorithm
  • Modified Newton method
  • Trust region method
  • Method of reduction
  • Genetic optimization
  • Wolfe-Powell-Fletcher algorithm
  • Quasi-Newton method
  • Method of conjugate gradients
  • Method of active sets
  • Sequential quadratic programming

Users can also create animated graphics of algorithm convergence and calculate the distribution functions and parameters of M/M/s, M/M/1, M/G/1, and Jackson network queuing systems.