摘要: … convex function approximation method and present a black sandwich algorithm which approximates a convex function using two convex … the triangle sandwich approximation, is that the …
core.ac.uk
elsevier.com
sci-hub.se 参考文章(10)
Günther F. Rühe, Algorithmic Aspects of Flows in Networks ,(1991)
Rainer E. Burkard, Horst W. Hamacher, Günter Rote, Sandwich approximation of univariate convex functions with an application to separable convex programming Naval Research Logistics. ,vol. 38, pp. 911- 924 ,(1991) , 10.1002/NAV.3800380609
Y. P. Aneja, K. P. K. Nair, BICRITERIA TRANSPORTATION PROBLEM Management Science. ,vol. 25, pp. 73- 78 ,(1979) , 10.1287/MNSC.25.1.73
N. Boland, C. J. Goh, A. I. Mees, An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons Journal of the Operational Research Society. ,vol. 43, pp. 979- 992 ,(1992) , 10.1057/JORS.1992.149
B. Fruhwirth, R.E. Bukkard, G. Rote, Approximation of convex curves with application to the bicriterial minimum cost flow problem European Journal of Operational Research. ,vol. 42, pp. 326- 338 ,(1989) , 10.1016/0377-2217(89)90443-8
Anthony V. Fiacco, Garth P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques ,(1968)
Norman Zadeh, A BAD NETWORK PROBLEM FOR THE SIMPLEX METHOD AND OTHER MINIMUM COST FLOW ALGORITHMS Mathematical Programming. ,vol. 5, pp. 255- 266 ,(1973) , 10.1007/BF01580132
Haijune Lee, P. Simin Pulat, Bicriteria network flow problems: Continuous case European Journal of Operational Research. ,vol. 51, pp. 119- 126 ,(1991) , 10.1016/0377-2217(91)90151-K
G. Rote, The convergence rate of the sandwich algorithm for approximating convex functions Computing. ,vol. 48, pp. 337- 361 ,(1992) , 10.1007/BF02238642
W. W. Cooper, A. Charnes, Management Models and Industrial Applications of Linear Programming ,(1961)