Synergy of linear programming and compromise programming in solving allocation problems

Paper analyses possibilities of combining standard linear programming (LP) with compromise programming (CP) while searching for their positive synergy in solving complex allocation problems. Procedure for coupling two different categories of discrete decision models is defined and direction for further research related to positive synergy identification is suggested.