Diskussion:Linear optimization: Phases of the Simplex method 2

Aus Operations-Research-Wiki
Version vom 8. Juli 2013, 10:42 Uhr von Drawert (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „Hello, We read your wikientry and we have some positive and some negative points: '''positives:''' #Your entry is well structured and the table of contents al…“)

(Unterschied) ← Nächstältere Version | Aktuelle Version (Unterschied) | Nächstjüngere Version → (Unterschied)
Wechseln zu: Navigation, Suche

Hello, We read your wikientry and we have some positive and some negative points:

positives:

  1. Your entry is well structured and the table of contents allows you to jump where ever you want
  2. especially phase 2 is pretty well done and good to understand. You even explained the different methods of solution (Steepest-Unit-Ascent, Greatest Change)
  3. you used colours in the example which made it easier to understand. Therefore pivot-column/-row and the highlighted pivot-element were easily recognisable.

negatives:

  1. in some points it´s a little bit difficult to understand what you meant, because of your expression
  2. you didn´t use LaTeX for your mathematical formulas
  3. your chosen example isn´t the best example to explain the phases of the simplex because an intial infeasibility is not given. So we think you have chosen 2 in the row of instead of the better pivot-element (in our opinion) 5 in row . But then we recognized that because of your choice a negative right-hand-side and therefore an infeasible solution is created.
  4. also your tableau isn´t solved. You should have written down the final solution in phase 2

All in all your entry was understandable and one can learn about the different phases of the simplex

Greetings Lucas Bertram, Niklas Drawert, Simon Liesenfeld (group 1 of the phases)