THE ELIMINATION OF RACIALLY IDENTIFIABLE SCHOOLS

Recent federal court decisions have emphasized the need to eliminate schools whose racial composition varies from that of the whole district by more than a fixed percent. A linear programming model is presented to assist school administrators in developing desegregation plans that comply with these guidelines. An efficient solutional technique that exploits the special structure of this model increases problem-size capabilities. A study of the Columbus City School District examines the tradeoffs involved at different levels of desegregation.

[1]  R. Dale McDaniel,et al.  Case study of the use of the transportation algorithm for school districting under federal integration guidelines , 1975 .

[2]  J. Lord.  Spatial perspectives on school desegregation and busing , 1977 .

[3]  Ernest Koenigsberg,et al.  Computed School Assignments in a Large District , 1973, Oper. Res..

[4]  Darwin Klingman,et al.  The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution Problems , 1972 .

[5]  Henry Sewell,et al.  Location criteria for high schools : student transportation and racial integration , 1975 .

[6]  Maurice Yeates,et al.  HINTERLAND DELIMITATION: A DISTANCE MINIMIZING APPROACH , 1963 .

[7]  Ronald P. Thompson,et al.  Linear programming, busing and educational administration , 1974 .

[8]  Ernest Koenigsberg,et al.  Mathematical analysis applied to school attendance areas , 1968 .

[9]  H. M. Taylor,et al.  School rezoning to achieve racial balance: A linear programming approach , 1969 .

[10]  J. Surkis,et al.  An operations research approach to racial desegregation of school systems , 1968 .

[11]  J. Weaver,et al.  Nonpartisan Political Redistricting by Computer , 1965 .

[12]  Abraham Charnes,et al.  The Stepping Stone Method of Explaining Linear Programming Calculations in Transportation Problems , 1954 .

[13]  H. D. Ratliff,et al.  A Network-Flow Model for Racially Balancing Schools , 1972, Oper. Res..

[14]  R. Cromley,et al.  The Bounded Transportation Problem , 1980 .