Algorithm for Spatial Straightness Evaluation Using Theories of Linear Complex Chebyshev Approximation and Semi Infinite Linear Programming  

Oleh:

Han, Ding ; LiMin, Zhu ; Ye, Ding

Jenis: Article from Journal - ilmiah internasional
Dalam koleksi: Journal of Manufacturing Science and Engineering vol. 128 no. 1 (Feb. 2006), page 167-174.
Topik: linear programming; algorithm; spatial straightness; evaluation; linear complex; semi infinite; linear programming

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: JJ93.8 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

This paper presents a novel methodology for evaluating spatial straightness error based on the minimum zone criterion. Spatial straightness evaluation is formulated as a linear complex Chebyshev approximation problem, and then reformulated as a semi - infinite linear programming problem. Both models for the primal and dual programs are developed. An efficient simplex - based algorithm is employed to solve the dual linear program to yield the straightness value. Also a general algebraic criterion for checking the optimality of the solution is proposed. Numerical experiments are given to verify the effectiveness and efficiency of the presented algorithm.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali