# Blog

## What is dual simplex? medium.com
Dual simplex method •What’s the dual simplex method? -It is a simplex based algorithm that works on the dual problem directly. In other words, it hops from one vertex to another vertex along some edge directions in the dual space.

## How does the simplex algorithm work?

• The Simplex Algorithm is a method of solving linear programming problems. In plain English, it's used to reach a goal while also having constraints. Since this is math, we're dealing with numbers and the formulas just use add, subtract and multiply (which is why it is called linear programming).

## Is the simplex method a greedy algorithm?

• Furthermore, the simplex method is able to evaluate whether no solution actually exists. It can be observed that the algorithm is greedy as it opts for the best option at every iteration, with no demand for information from earlier or forthcoming iterations.

## What is dual simplex?What is dual simplex?

The dual simplex method starts with a superoptimal (too good to be true) but infeasible solution and generates a sequence of progressively less infeasible (and less superoptimal) ones until it arrives at a feasible solution (which will be optimal).

## How does the simplex algorithm work?How does the simplex algorithm work?

The Simplex Algorithm is a method of solving linear programming problems. In plain English, it's used to reach a goal while also having constraints. Since this is math, we're dealing with numbers and the formulas just use add, subtract and multiply (which is why it is called linear programming).  ### Is the simplex method a greedy algorithm?Is the simplex method a greedy algorithm?

Furthermore, the simplex method is able to evaluate whether no solution actually exists. It can be observed that the algorithm is greedy as it opts for the best option at every iteration, with no demand for information from earlier or forthcoming iterations.