| contributor author | Chihsiung Lo | |
| contributor author | P. Y. Papalambros | |
| date accessioned | 2017-05-08T23:51:10Z | |
| date available | 2017-05-08T23:51:10Z | |
| date copyright | March, 1996 | |
| date issued | 1996 | |
| identifier issn | 1050-0472 | |
| identifier other | JMDEDB-27634#82_1.pdf | |
| identifier uri | http://yetl.yabesh.ir/yetl/handle/yetl/117446 | |
| description abstract | Global optimization algorithms for generalized polynomial design models using a global feasible search approach was discussed in a previous article. A new convex cutting plane algorithm (CONCUT) based on global feasible search and with improved performance is presented in this sequel article. Computational results of the CONCUT algorithm compared to one using linear cuts (LINCUT) are given for various test problems. A speed reducer design example illustrates the application of the algorithms. | |
| publisher | The American Society of Mechanical Engineers (ASME) | |
| title | A Convex Cutting Plane Algorithm for Global Solution of Generalized Polynomial Optimal Design Models | |
| type | Journal Paper | |
| journal volume | 118 | |
| journal issue | 1 | |
| journal title | Journal of Mechanical Design | |
| identifier doi | 10.1115/1.2826861 | |
| journal fristpage | 82 | |
| journal lastpage | 88 | |
| identifier eissn | 1528-9001 | |
| keywords | Algorithms | |
| keywords | Design | |
| keywords | Cutting | |
| keywords | Polynomials AND Optimization algorithms | |
| tree | Journal of Mechanical Design:;1996:;volume( 118 ):;issue: 001 | |
| contenttype | Fulltext | |
