Titlebook: Computational Mathematical Programming; K. L. Hoffman,R. H. F. Jackson,J. Telgen Book 1987Latest edition Springer-Verlag Berlin Heidelberg

并排一起

書(shū)目名稱(chēng)Computational Mathematical Programming影響因子(影響力)




書(shū)目名稱(chēng)Computational Mathematical Programming影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Computational Mathematical Programming網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Computational Mathematical Programming網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Computational Mathematical Programming被引頻次




書(shū)目名稱(chēng)Computational Mathematical Programming被引頻次學(xué)科排名




書(shū)目名稱(chēng)Computational Mathematical Programming年度引用




書(shū)目名稱(chēng)Computational Mathematical Programming年度引用學(xué)科排名




書(shū)目名稱(chēng)Computational Mathematical Programming讀者反饋




書(shū)目名稱(chēng)Computational Mathematical Programming讀者反饋學(xué)科排名

Inelasticity

存心

雄辯

Computer-assisted analysis for diagnosing infeasible or unbounded linear programs,nalysis, after the difficulty has been detected, or for preventive analysis. The first method is by successive reduction of bounds on primal quantities and dual prices. This is the most commonly used method in practice due to the availability of REDUCE procedures in commercial mathematical programmi

dissent

Restricted simplicial decomposition: Computation and extensions,ignment problem and other network flow problems. The “restricted” version of this method allows the user to treat the maximum size of the generated simplices as a parameter. When the parameter is at its minimum value, the method reduces to the Frank-Wolfe algorithm; when at its maximum, the original

oxidize

oxidize

A new algorithm for highly curved constrained optimisation, both the objective function and constraints. At every iteration a subproblem based on the second order approximation of the objective and constraints functions is solved. Three strategies to solve the subproblem are used. Some computational results are given. Although the performance of the subrout

官僚統(tǒng)治

An implementation of an algorithm for univariate minimization and an application to nested optimizating of the corresponding FORTRAN subroutine PQ1, an explanation of its general use and a description of its particular use in solving a practical resource allocation problem via a dual technique requiring nested optimization.

責(zé)問(wèn)

Fissure

Restricted simplicial decomposition: Computation and extensions,, and linearly constrained problems of the Colville study..Conditions are given for which RSD converges after a finite number of major cycles, and variations of RSD which have potential for real-world applications are developed. These include a quadratic approximation of the master problem and an ex