Lacunar-Stroke
发表于 2025-3-26 23:17:54
Mathematical Programming at Oberwolfach978-3-642-00806-1Series ISSN 0303-3929 Series E-ISSN 2364-8201
谷物
发表于 2025-3-27 03:16:02
0303-3929 Overview: 978-3-642-00806-1Series ISSN 0303-3929 Series E-ISSN 2364-8201
Ophthalmologist
发表于 2025-3-27 06:07:06
http://reply.papertrans.cn/63/6266/626553/626553_33.png
围巾
发表于 2025-3-27 11:07:04
,Khachiyan’s algorithm for linear programming,L.G. Khachiyan’s algorithm to check the solvability of a system of linear inequalities with integral coefficients is described. The running time of the algorithm is polynomial in the number of digits of the coefficients. It can be applied to solve linear programs in polynomial time.
Ophthalmologist
发表于 2025-3-27 15:32:38
http://reply.papertrans.cn/63/6266/626553/626553_35.png
conifer
发表于 2025-3-27 18:33:17
http://reply.papertrans.cn/63/6266/626553/626553_36.png
反叛者
发表于 2025-3-27 23:24:56
Some continuity properties of polyhedral multifunctions,A multifunction is . if its graph is the union of finitely many polyhedral convex sets. This paper points out some fairly strong continuity properties that such multifunctions satisfy, and it shows how these may be applied to such areas as linear complementarity and parametric programming.
Recessive
发表于 2025-3-28 05:59:10
A resource decomposition algorithm for general mathematical programs,gorithm, can be developed for general mathematical programs. As an example of this algorithm we obtain an algorithm for bilinear programs. In addition we examine a question of importance for postoptimality analysis, that of finding an optimal dual solution to the original problem from the solution of the decomposed problem.
Gorilla
发表于 2025-3-28 09:06:06
https://doi.org/10.1007/BFb0120916Mathematica; optimization; programming
里程碑
发表于 2025-3-28 14:11:17
http://reply.papertrans.cn/63/6266/626553/626553_40.png