Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("SIMPLEX METHOD")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1381

  • Page / 56
Export

Selection :

  • and

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

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

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

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

FUNCTION MINIMISATION USING THE NELDER AND MEAD SIMPLEX METHOD WITH LIMITED-ARITHMETIC PRECISION: THE SELF REGENERATIVE SIMPLEX.AKITT JW.1977; COMPUTER J.; G.B.; DA. 1977; VOL. 20; NO 1; PP. 84-85; BIBL. 5 REF.Article

COMMENT ON A PAPER BY M. C. CHENGBROSIUS L.1981; MATH. PROGRAM.; ISSN 0025-5610; NLD; DA. 1981; VOL. 21; NO 2; PP. 229-232; BIBL. 1 REF.Article

LA METHODE DE KHACHYAN: DESCRIPTION ET JUSTIFICATION MATHEMATIQUEKIEHM JL; VINCKE P.1981; CAH. CENT. ETUD. RECH. OPER.; ISSN 0008-9737; BEL; DA. 1981; VOL. 23; NO 2; PP. 105-120; BIBL. 6 REF.Article

A QUICK MATRIX MULTIPLICATION IN THE SIMPLEX ALGORITHMMANDEL J; TURNOVEC F.1981; EKON.-MAT. OBZ.; ISSN 0013-3027; CSK; DA. 1981; VOL. 17; NO 2; PP. 180-182; ABS. CZEArticle

NEW CRITERIA FOR THE SIMPLEX ALGORITHMCHENG MC.1980; MATH. PROGRAMMG; NLD; DA. 1980; VOL. 19; NO 2; PP. 230-236; BIBL. 1 REF.Article

ON ONE-ROW LINEAR PROGRAMSWITZGALL C.1980; LECTURE NOTES ECON. MATH. SYST.; DEU; DA. 1980; NO 174; PP. 384-414; BIBL. 10 REF.Conference Paper

METHODES SIMPLEXES DE RECHERCHE DIRECTERYKOV AS.1980; IZV. AKAD. NAUK SSSR, TEH. KIBERN.; ISSN 0002-3388; SUN; DA. 1980; NO 5; PP. 17-22; BIBL. 6 REF.Article

AN EXPERIMENTAL ALGORITHM FOR N-DIMENSIONAL ADAPTIVE QUADRATUREKAHANER DK; WELLS MB.1979; A.C.M. TRANS. MATH. SOFTWARE; USA; DA. 1979; VOL. 5; NO 1; PP. 86-96; BIBL. 18 REF.Article

PRICING FOR SPARSITY IN THE REVISED SIMPLEX METHODHO JK.1978; R.A.I.R.O., RECH. OPERAT.; FRA; DA. 1978; VOL. 12; NO 3; PP. 285-290; BIBL. 12 REF.Article

SOLVING SINGLY CONSTRAINED TRANSSHIPMENT PROBLEMSGLOVER F; KARNEY D; KLINGMAN D et al.1978; TRANSPORT. SCI.; USA; DA. 1978; VOL. 12; NO 4; PP. 277-297; BIBL. 34 REF.Article

A NOTE ON THE PRIMAL-DUAL AND OUT-OF-KILTER ALGORITHMS FOR NETWORK OPTIMIZATION PROBLEMS.SHAPIRO JF.1977; NETWORKS; U.S.A.; DA. 1977; VOL. 7; NO 1; PP. 81-88; BIBL. 1 P. 1/2Article

A PRACTICABLE STEEPEST-EDGE SIMPLEX ALGORITHM.GOLDFARB D; REID JK.1977; MATH. PROGRAMMG; NETHERL.; DA. 1977; VOL. 12; NO 3; PP. 361-371; BIBL. 13 REF.Article

METHODE DE FACTORISATION DANS LES PROBLEMES DE PROGRAMMATION DYNAMIQUE LINEAIREKRIVONOZHKO VE; CHEBOTAREV SP.1976; AUTOMAT. I TELEMEKH.; S.S.S.R.; DA. 1976; NO 7; PP. 80-90; ABS. ANGL.; BIBL. 7 REF.Article

PROBLEMES DE PRECISION DANS LA RESOLUTION DES PROBLEMES D'OPTIMISATIONLARCHENKO NE.1974; IN: MAT. METHODY EHKON. ISSLED.; MOSKVA; NAUKA; DA. 1974; PP. 38-44; BIBL. 4 REF.Book Chapter

DETERMINATION DE LA COMPOSITION OPTIMUM DU CLINKER PAR LA METHODE DES SIMPLEXES SUCCESSIFSBENSHTEJN YU I.1983; CEMENT; ISSN 0041-4867; SUN; DA. 1983; NO 7; PP. 16-17; BIBL. 4 REF.Article

METHODE ELLIPSOIDALE ET ALGORITHME DU SIMPLEXE: COMPLEXITE THEORIQUE ET PRATIQUEKIEHM JL; VINCKE P.1982; CAH. CENT. ETUD. RECH. OPER.; ISSN 0008-9737; BEL; DA. 1982; VOL. 24; NO 2-4; PP. 297-304; BIBL. 8 REF.Article

INTRODUCTION TO LINEAR PROGRAMMINGCAMPBELL LH.1981; IEE CONTROL ENG. SER.; ISSN 0262-1797; GBR; DA. 1981; NO 16; PP. 77-96; BIBL. 7 REF.Article

A COMPARISON OF INTERVAL LINEAR PROGRAMMING WITH THE SIMPLEX METHODGUNN EA; ANDERS GJ.1981; LINEAR ALGEBRA & APPL.; ISSN 0024-3795; USA; DA. 1981; VOL. 38; PP. 149-159; BIBL. 7 REF.Article

APPLICATIONS OF QUASI-MARKOV SIMPLEX MODELS ACROSS POPULATIONSWERTS CE; PIKE LW; ROCK DA et al.1981; EDUC. PSYCHOL. MEAS.; ISSN 0013-1644; USA; DA. 1981; VOL. 41; NO 2; PP. 295-307; BIBL. 2 P.Article

IMPLEMENTATION AND ANALYSIS OF A VARIANT OF THE DUAL METHOD FOR THE CAPACITATED TRANSSHIPMENT PROBLEMARMSTRONG RD; KLINGMAN D; WHITMAN D et al.1980; EUROP. J. OPERAT. RES.; NLD; DA. 1980; VOL. 4; NO 6; PP. 403-420; BIBL. 20 REF.Article

  • Page / 56