Author/Authors :
Salehi Fathabadi، H. نويسنده , , Nadimi، R. نويسنده Department of Applied Mathematics, School of Mathematics, Statistics, and Computer Science, Faculty of Sciences, University of Tehran, Tehran, Islamic Republic of Iran ,
Abstract :
The pupose of this paper is modeling of Partial Digest Problem (PDP) as a mathematical programming problem. In this paper we present a new viewpoint of PDP. We formulate the PDP as a continuous optimization problem and develope a method to solve this problem. Finally we constract a linear programming model for the problem with an additional constraint. This later model can be solved by the simplex method in which a restricted basis-entry-rule is defined.
