# Difference between revisions of "Simplex algorithm"

Jump to navigation
Jump to search

(Created page with "Author: Guoqing Hu (SysEn 6800 Fall 2020) Steward: Allen Yang, Fengqi You") |
|||

Line 2: | Line 2: | ||

Steward: Allen Yang, Fengqi You | Steward: Allen Yang, Fengqi You | ||

+ | |||

+ | == Introduction == | ||

+ | Simplex algorithm (or Simplex method) is a widely-used algorithm to solve the Linear Problem (LP). Simplex algorithm can be thought as one of the elementary steps for solving the inequality problem since many of those will be converted to LP and solved via Simplex algorithm. Simplex algorithm has been proposed by [[wikipedia:George_Dantzig|George Dantzig]] |

## Revision as of 20:50, 17 November 2020

Author: Guoqing Hu (SysEn 6800 Fall 2020)

Steward: Allen Yang, Fengqi You

## Introduction

Simplex algorithm (or Simplex method) is a widely-used algorithm to solve the Linear Problem (LP). Simplex algorithm can be thought as one of the elementary steps for solving the inequality problem since many of those will be converted to LP and solved via Simplex algorithm. Simplex algorithm has been proposed by George Dantzig