By Topic

Homogeneous magnet design using linear programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hao Xu ; Dept. of Electr. Eng., Stanford Univ., CA, USA ; Conolly, S.M. ; Scott, G.C. ; Macovski, A.

We introduce a technique for designing homogeneous magnets using linear programming, We first show that minimum-power homogeneous magnet design can be cast as a linear programming problem. We also show that the method is applicable to minimum conductor mass superconducting magnet design. The method has several advantages over existing techniques including: it allows complete flexibility in arbitrary geometric constraints on both the coil locations and the shape of the homogeneous volume; it guarantees a globally optimal solution; and it offers rapid computation speed (about 30 s). Three resistive magnet design examples and one shielded superconducting magnet design are presented to illustrate the flexibility of the method

Published in:

Magnetics, IEEE Transactions on  (Volume:36 ,  Issue: 2 )