Page 3 of 5 as do Do} | | Dill E435} Al 60 El '5 Cl 240 D) 24 El Il-EIIZI 1D]I The " point at which to reorder" depends directly on which of the following? Al E 0Q Ell ordering cost Cl lead-time Ell storage costs El unit purchasing cost lllWith_ AlVMI all sac clans DlJIT sijsr , inventory arrives just before it is needed. 123' A feasible solution to a linear programming problem All must be a corner point of the feasible region. Ell must satisfy all of the problem's constraints simultaneously. Cl need not satisfy all of the constraints, only the non-negativity constraints. Ell must give the maximum possible prot. El must give the minimum possible cost. 13) The corner point solution method All will always provide one, and only one, optimum. Ell will yield different results from the isoprot line solution method. Cl requires that the prot from all corners of the feasible region be compared. Ell requires that all corners created by all constraints be compared. El will not provide a solution at an intersection or corner where a non-negativity constraint is involved