This is a tool for teaching simplex and branch & bound methods. For simplex method, it comes with several examples including degeneracy and cycling, and allow the user to dictate how to pivot. For branch and bound method, it is desinged to interact with the user to explore all possible branch and bound trees. The user can also load a problem from a text file or simply type in a model directly. The format is very simple and very similar to the LP format, see the packed-in examples.

Features

  • You can save everything as Excel files easily (tab-separated text)
  • Input file format is given interactively when you load/input the model
  • The branch & bound tree is interactively updated while exploring
  • Sensitivity report is supported once a model is solved to optimality
  • Runs on any platform, only requires Python.

Project Activity

See All Activity >

License

MIT License

Follow simplex with branch and bound

simplex with branch and bound Web Site

Other Useful Business Software
Create and run cloud-based virtual machines. Icon
Create and run cloud-based virtual machines.

Secure and customizable compute service that lets you create and run virtual machines on Google’s infrastructure.

Computing infrastructure in predefined or custom machine sizes to accelerate your cloud transformation. General purpose (E2, N1, N2, N2D) machines provide a good balance of price and performance. Compute optimized (C2) machines offer high-end vCPU performance for compute-intensive workloads. Memory optimized (M2) machines offer the highest memory and are great for in-memory databases. Accelerator optimized (A2) machines are based on the A100 GPU, for very demanding applications.
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of simplex with branch and bound!

Additional Project Details

Languages

English

Intended Audience

Education

User Interface

Console/Terminal

Programming Language

Python

Related Categories

Python Computer Aided Instruction (CAI) Software

Registered

2012-12-11