A SIZE REDUCTION TECHNIQUE FOR A CLASS OF LINEAR PROGRAMMING PROBLEMS

Linear Programming (LP) is a powerful tool for optimization problems in numerous contexts. Despite the impressive utility of this tool, however,the LP representation of most problems usually involves a strenuously large number of variables. This work introduces a technique for reducing the number of such variables for a class of LP problems. The presented technique can be easily adapted for use in various optimization problems such as those which arise in engineering.