TRIANGULAR FACTORIZATION AND GENERALIZED UPPER BOUNDING TECHNIQUES.KALLIO M; PORTEUS EL.1977; OPER. RES.; U.S.A.; DA. 1977; VOL. 25; NO 1; PP. 89-99; BIBL. 11 REF.Article

A METHOD OF THE LINEAR PROGRAMMINGBUSUIOC D.1972; REV. ROUMAINE SCI. TECH., ELECTROTECH. ENERGET.; ROUMAN.; DA. 1972; VOL. 17; NO 2; PP. 337-346; BIBL. 4 REF.Serial Issue

A WEIGHTED SIMPLEX PROCEDURE FOR THE SOLUTION OF SIMULTANEOUS NON-LINEAR EQUATIONSPRICE WL.1979; J. INST. MATH. APPL., LONDON; GBR; DA. 1979; VOL. 24; NO 1; PP. 1-8; BIBL. 3 REF.Article

CONVEX SIMPLEX METHOD AND NONLINEAR PROGRAMMING PROBLEMS.KANTI SWARAUP; MOHINDER KAUR BEDI.1977; INDIAN J. PURE APPL. MATH.; INDIA; DA. 1977; VOL. 6; NO 2; PP. 190-209; BIBL. 12 REF.Article

LINEAR MULTIPARAMETRIC PROGRAMMING BY MULTICRITERIA SIMPLEX METHOD.YU PL; ZELENY M.1976; MANAG. SCI.; U.S.A.; DA. 1976; VOL. 23; NO 2; PP. 159-170; BIBL. 20 REF.Article

THE SIMPLEX METHOD FOR DYNAMIC LINEAR PROGRAMSPROPOI A; KRIVONOZHKO V.1978; INTERNATION. INST. APPL. SYST. ANAL., RES. REP.; AUT; DA. 1978; VOL. 78; NO 14; PP. 1-85; BIBL. 9 REF.Serial Issue

AN EXPLICIT WAY OF FINDING ABSOLUTE MAXIMUM OF STRICTLY CONCAVE PARAMETRIC QUADRATIC FUNCTION WITH LINEAR PARAMETRIC DEPENDENT CONSTRAINTSGAJARSKY T.1972; ACTA FAC. RERUM NAT. UNIV. COMENIANAE, MATH.; TCHECOSL.; DA. 1972; NO 27; PP. 53-64; BIBL. 10 REF.Serial Issue

NON-LINEAR DYNAMICAL CIRCUIT ANALYSIS BY SIMPLEX TECHNIQUESBLASI F; MARTINELLI G; ORLANDI G et al.1980; ALTA FREQ.; ISSN 0002-6557; ITA; DA. 1980; VOL. 49; NO 4; PP. 293-297; BIBL. 8 REF.Article

RESULTS FROM THE APPLICATION OF THE SIMPLEX METHOD TO THE INVERSE GRAVIMETRIC PROBLEM.IVANOVA PK.1976; C.R. ACAD. BULG. SCI.; BULG.; DA. 1976; VOL. 29; NO 11; PP. 1617-1619; BIBL. 9 REF.Article

SOME ADDITIONAL VIEWS ON THE SIMPLEX METHOD AND THE GEOMETRY OF CONSTRAINT SPACE.ORCHARD HAYS WM.1976; INTERNATION. INST. APPL. SYST. ANAL., RES. REP.; AUSTR.; DA. 1976; VOL. 76; NO 3; PP. (83P.)Serial Issue

ALGORITHMS FOR OPTIMIZATION OF POWER SYSTEMS SCHEDULES BASED ON THE SIMPLEX METHOD.CHALY GV; ZLOTNIK SG; LAZEBNIK AI et al.1974; KYBERNETES; G.B.; DA. 1974; VOL. 3; NO 3; PP. 161-172; BIBL. 9 REF.Article

EXTRACTION DE N POINTS DU SYSTEME FONDAMENTAL A PARTIR DU SYSTEME VECTORIEL A L'AIDE DE L'ETOILE DU SYMPLEXE A (N-1) DIMENSIONSGALIULIN RV; SIROTA MI; NAUMOV AS et al.1973; KRISTALLOGRAFIJA; S.S.S.R.; DA. 1973; VOL. 18; NO 1; PP. 63-68; BIBL. 8 REF.Serial Issue

PROCEDE DE RESOLUTION PAR BLOCS DES PROBLEMES DE PROGRAMMATION LINEAIREBAKHTIN AE.1971; IN: MAT. METODY RESHENIYA EHKON. ZADACH; NOVOSIBIRSK; NAUKA; DA. 1971; PP. 63-78; BIBL. 5 REF.Book

APPLICAZIONE DEL METODO DEL SIMPLESSO AL TEOREMA FONDAMENTALE PER LE PROBABILITA NELLA CONCEZIONE SOGGETTIVISTICA = APPLICATION DE LA METHODE DU SIMPLEXE AU THEOREME FONDAMENTAL POUR LES PROBABILITES DANS LA THEORIE SUBJECTIVEBRUNO G; GILIO A.1980; STATISTICA; ISSN 0390-590X; ITA; DA. 1980; VOL. 40; NO 3; PP. 337-344; ABS. ENG/FRE; BIBL. 3 REF.Article

SCREENING CONCEPTS AND DESIGNS FOR EXPERIMENTS WITH MIXTURES.SNEE RD; MARQUARDT DW.1976; TECHNOMETRICS; U.S.A.; DA. 1976; VOL. 18; NO 1; PP. 19-29; BIBL. 26 REF.Article

EINE ALLGEMEINE METHODE ZUR BERECHNUNG VON MINIMAX-FEHLERN. I. BEI VORLIEGENDEN MESSUNGEN. = UNE METHODE GENERALE DE CALCUL DES ERREURS MINIMAX. I. CAS DE MESURES EXISTANTESHEINDL G; REINHART E.1976; Z. VERMESSUNGSWES.; DTSCH.; DA. 1976; VOL. 101; NO 4; PP. 126-132; ABS. ANGL.; BIBL. 6 REF.Article

SIMPLEXE ORDINAIRE ET FORME REVISEE DU SIMPLEXE: MISE EN FACTEUR MATRICIELLE.STRUM JE.1975; REV. BELGE STATIST. INFORMAT. RECH. OPERAT.; BELG.; DA. 1975; VOL. 15; NO 4; PP. 5-22Article

OPTIMISATION DE FERMES A TIRANTS SOUS L'ACTION DE PLUSIEURS COMBINAISONS DE CHARGESALYAVDIN PV; DARKOVICH SS.1975; IZVEST. VYSSH. UCHEBN. ZAVED., STROITEL. ARKHIT.; S.S.S.R.; DA. 1975; VOL. 18; NO 7; PP. 37-40; BIBL. 3 REF.Article

ENHANCEMENTS OF SPANNING TREE LABELLING PROCEDURES FOR NETWORK OPTIMIZATIONBARR R; GLOVER F; KLINGMAN D et al.1979; INFOR; CAN; DA. 1979; VOL. 17; NO 1; PP. 16-34; ABS. FRE; BIBL. 13 REF.Article

ON THE FOUNDATIONS OF LINEAR AND INTEGER LINEAR PROGRAMMING I.GRAVER JE.1975; MATH. PROGRAMMG; NETHERL.; DA. 1975; VOL. 9; NO 2; PP. 207-226; BIBL. 7 REF.Article

ON THE POSSIBILITY OF REPLACING THE BACKWARD TRANSFORMATION IN THE MODIFIED SIMPLEX METHOD BY AFORWARD TRANSFORMATIONMEZEI M; SZONDY T.1973; J. INST. MATH. APPL., LONDON; G.B.; DA. 1973; VOL. 11; NO 3; PP. 339-342; BIBL. 3 REF.Serial Issue

SIMPLEX ALGORITHMS FOR UNCONSTRAINED MINIMIZATIONRYKOV AS.1983; PROBLEMS OF CONTROL AND INFORMATION THEORY; ISSN 0370-2529; HUN; DA. 1983; VOL. 12; NO 3; PP. 195-207; ABS. RUS; BIBL. 7 REF.Article

LINEAR PROGRAMMING: A SURVEY OF GENERAL PURPOSE ALGORITHMS.BARNES JW; CRISP RM JR.1975; A.I.I.E. TRANS.; U.S.A.; DA. 1975; VOL. 7; NO 3; PP. 212-221; BIBL. 2 P.Article

ANALOGUES DES SIMPLEXES REGULIERS DANS LES ESPACES NORMESSOLTAN PS.1975; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1975; VOL. 222; NO 6; PP. 1303-1305; BIBL. 7 REF.Article

EINIGE BEMERKUNGEN ZUR M-METHODE DER LINEAREN OPTIMIERUNG = QUELQUES REFLEXIONS SUR LE M-PROBLEME EN PROGRAMMATION LINEAIRETAMMER K.1971; EKON.-MAT. OBZ.; CESKOSL.; DA. 1971; VOL. 7; NO 4; PP. 419-425; ABS. TCHEQUE ANGL.; BIBL. 6 REF.Serial Issue