1. The linear programming problem associated with each step of the procedure is solved through a primal-dual algorithm.

2. It is transformed ingeniously into a non-linear programming problem with constraints which can be solved by many optimal methods.

3. The solution to the lower bound linear programming problem defines a statically admissible stress field and a "safe" estimate of the collapse load, whereas the solution to the upper bound linear programming problem defines a kinematically admissible velocity field and an "unsafe" estimate of the collapse load.

4. Introduces a programming system for use with microcomputer and its function and characteristic. presents the linear programming model, simplex algorithm and some calculative processes.

5. A heuristic method combined genetic algorithm and parameter linear programming is proposed to the FCLSP. A simulation example shows that the method is effective.

6. In this way, according to gap acceptance theory and Linear Programming Model, we can establish a model of the weaving section in a traffic circle.

7. A rotation transformation method is to be used in changing an ordinary linear programming (LP)problem into an equivalent easily-solved continuous knapsack one after a finite iteration.

8. The reasons why we will study linear programming are that 1.Linear programs can be solved in polynomial time, and very e ciently in practice; 2.All the Combinatorial problems …

9. In order to minimize the expected loss of overstock and shortage, first of all the optimal supply is determined, and then a mixed integer linear programming model under certainty is built.