31. Karmarkar's algorithm solves linear programming problems in polynomial time. 32. Linear programming relaxation is a standard technique for designing approximation algorithms for hard optimization problems.33. Simplex methods or interior point methods can be applied to solve the linear programming problem. 34. Megiddo used this approach to solve linear programming in linear time when dimension is fixed. 35. The Stigler diet question is a linear programming problem. 36. Okay, so I have a basic linear programming course this summer ( not my field ). 37. If fractional flows are allowed, the problem can be solved in polynomial time through linear programming . 38. Rhodes originated the Rhodes algorithm in linear programming . 39. The theory behind linear programming drastically reduces the number of possible solutions that must be checked. 40. There is a general, parallel implementation available that leverages the open source GNU Linear Programming Kit.
