可化为单约束的线性规划问题

On Linear Programming Problems Which Can be Tranformed into Single Constrainted

本文主要讨论可以化为单约束的多约束线性规划问题。对于这类问题,在寻求较简单解法时提出了主约束概念和判别主约束的方法,并探讨了此法在化简其它一些线性规划问题方面的应用。

This paper discusses the linear programming of multi-constraint problems which can be transformed into single constrainted problems.For simplicity, main constraint coception and methods of finding main constrainr is presenred, some applications in simplifing other linear programming problems are introduced with this method.