STRONG CUT CUTTING PLANE METHOD FOR EXTREME POINT LINEAR FRACTIONAL PROGRAMMING.PURI MC.1975; CAH. CENTRE ET. RECH. OPERAT.; BELG.; DA. 1975; VOL. 17; NO 1; PP. 65-69; BIBL. 9 REF.Article

A STUDY OF COST VARIATIONS IN EXTREME POINT MATHEMATICAL PROGRAMMING PROBLEMSBAKHSHI HC; PURI MC.1980; INDIAN J. PURE APPL. MATH.; IND; DA. 1980; VOL. 11; NO 7; PP. 829-837; BIBL. 8 REF.Article

ENUMERATION TECHNIQUE FOR THE SET COVERING PROBLEM WITH A LINEAR FRACTIONAL FUNCTIONAL AS ITS OBJECTIVE FUNCTION.ARORA SR; PURI MC.1977; Z. ANGEW. MATH. MECH.; DTSCH.; DA. 1977; VOL. 57; NO 3; PP. 181-186; ABS. ALLEM. RUSSE; BIBL. 11 REF.Article

STRONG-CUT CUTTING PLANE PROCEDURE FOR EXTREME POINT MATHEMATICAL PROGRAMMING PROBLEMS.PURI MC; KANTI SWARUP.1975; INDIAN J. PURE APPL. MATH.; INDIA; DA. 1975; VOL. 6; NO 3; PP. 227-236; BIBL. 9 REF.Article

A SYSTEMATIC EXTREME POINT ENUMERATION PROCEDURE FOR FIXED CHARGE PROBLEM.PURI MC; KANTI SWARUP.1974; TRAB. ESTADIST. INVEST. OPER.; ESP.; DA. 1974; VOL. 25; NO 1-2; PP. 99-108; BIBL. 1 P.Article

DEEP CUT PROCEDURE FOR EXTREME POINT MATHEMATICAL PROGRAMMING PROBLEMSPURI MC; KANTI SWARUP.1973; CAH. CENTRE ET. RECH. OPERAT.; BELG.; DA. 1973; VOL. 15; NO 1; PP. 68-81; BIBL. 10 REF.Serial Issue

EXTREME POINT LINEAR FRACTIONAL FUNCTIONAL PROGRAMMING.PURI MC; SWARUP K.1974; Z. OPER. RES.; DTSCH.; DA. 1974; VOL. 18; NO 3; PP. 131-139; BIBL. 10 REF.Article

TIME MINIMIZING SOLID TRANSPORTATION PROBLEM.BHATIA HL; KANTI SWARUP; PURI MC et al.1976; MATH. OPER.-FORSCH. STATIST.; DTSCH.; DA. 1976; VOL. 7; NO 3; PP. 395-403; ABS. ALLEM. RUSSE; BIBL. 9 REF.Article

THE ENUMERATION TECHNIQUE FOR TIME-COST TRADE-OFF IN A TRANSPORTATION PROBLEMBHATIA HL; KANTI SWARUP; PURI MC et al.1979; CAH. CENTRE ET. RECH. OPERAT.; BEL; DA. 1979; VOL. 21; NO 1; PP. 63-75; BIBL. 11 REF.Article