ABSTRACT
The objective of this chapter is to develop a reliable tool for solving all types of linear programming problems of real world which would involve industrial and business problems, etc. C is an efficient language for all types of numerical computations. A program in C is written for solving typical problems of linear programming in fractions and integers. Simplex method, two-phase method, dual simplex, and their important concepts such as initial basic feasible solutions, basic feasible solutions, constraints’ set of the linear programming problem, addition of a new constraint, and Gomory’s cutting-plane algorithm are discussed, and codes in C language are also written for these features. The convergence of simplex method is also discussed.
