Simplex Algorithm by safirah sabaruddin

CONVERT LP TO STANDARD FORM

safirahsabaruddin95 — 2016-09-26 07:34:14 UTC

1. When constraint ( >=)
- then we define each constraint an excess variable
2. When constraint(<=)
-then we define each constraint a slack variable

ALTERNATE OPTIMAL SOLUTIONS & UNBOUNDED LPs

safirahsabaruddin95 — 2016-09-27 07:06:04 UTC

a) Unique solution- All non-basic variable share non-zero coefficient in last row
b) Alternative Optimal Solution- if there is a non-basic variable which also has a zero coefficient in the last row
c) Unbounded - Non-basic variable with negative coefficient in last row has a positive coefficient in each constraint

Simplex Algorithm-MIN LP

norulaznita_ahmad — 2016-09-27 07:39:59 UTC

Simplex Algorithm-Max LP

norsyafiqaismail — 2016-09-27 07:47:23 UTC

nurnazihahaswa — 2016-09-27 07:53:23 UTC

yuyumaurer — 2016-09-27 07:55:35 UTC