In this paper we be concerned with a special class of bilinear integer programming problems (PI). Its objective function and constraints have variables which are multiplicative of two different variables. By restricting the integer condition of problem we shall study relaxation problem (PIR) and reduce (PI) to solve linear integer programmer problems.
Readership Map
Content Distribution
In this paper we be concerned with a special class of bilinear integer programming problems (PI). Its objective function and constraints have variables which are multiplicative of two different variables. By restricting the integer condition of problem we shall study relaxation problem (PIR) and reduce (PI) to solve linear integer programmer problems.
