One method of solving this problem is improved by using Bland's rule, and a polynomial-time method of solving this problem is the ellipsoid algorithm. Interior-point algorithms, like Karmarkar's, are another method of solving these problems. The fundamental theorem of solving these problems states that there either exists a finite solution, or the problem is either infeasible or unbounded. A popular method used to solve this kind of problem introduces slack variables in order to find a canonical tableau, and in n-dimensional space it attempts to find the vertices of a region bounded by a series of hyperplanes; that is known as the simplex method. Originally developed to optimize plywood production by Leonid Kantorovich, for 10 points, name 
One method of solving this problem is improved by using Bland's rule, and a polynomial-time method of solving this problem is the ellipsoid algorithm. Interior-point algorithms, like Karmarkar's, are another method of solving these problems. The fundamental theorem of solving these problems states that there either exists a finite solution, or the problem is either infeasible or unbounded. A popular method used to solve this kind of problem introduces slack variables in order to find a canonical tableau, and in n-dimensional space it attempts to find the vertices of a region bounded by a series of hyperplanes; that is known as the simplex method. Originally developed to optimize plywood production by Leonid Kantorovich, for 10 points, name this type of optimization problem which seeks to maximize a first-order function given a series of constraints.
One method of solving this problem is improved by using Bland's rule, and a polynomial-time method of solving this problem is the ellipsoid algorithm.
Linear Programming or Linear optimization [prompt on optimization]