LINEAR PROGRAMMING

1234567891011121314151617
Across
  1. 2. prices which dual solutions refer to
  2. 3. variables that only appear in a single constraint
  3. 5. when you want an alternative to big M
  4. 7. form of LP with all constraints as equalities
  5. 10. more than one optimal solution
  6. 11. operation to change a non basic variable to basic
  7. 12. these variables used to get initial basic feasible solution
  8. 14. rule to decide the leaving basic variable
  9. 15. maximization problem with all less than or equal type constraint
  10. 16. when simplex goes into an infinite loop
  11. 17. Most Common LP solving algorithm
Down
  1. 1. person who gave polynomial time algorithm
  2. 4. algorithm dealing with finding optimum assignment
  3. 6. worst case complexity of SIMPLEX
  4. 7. another name for post-optimality analysis
  5. 8. Every primal has this
  6. 9. nothing better than this
  7. 13. solution which satisfy all the constraints