Using Linear Programming to Find Approximate Solutions to the Fields to Impute Problem for Industry Data

Patrick G. McKeown and Joanne R. Schaffer
Additional contact information
Patrick G. McKeown: University of Georgia
Joanne R. Schaffer: University of Georgia

A chapter in Computer Science and Statistics: Proceedings of the 13th Symposium on the Interface, 1981, pp 288-291 from Springer

Abstract: Abstract Sande has suggested a mathematical programming formulation of the fields to impute problem (FTIP) for continuous data. This formulation seeks to find a minimum weighted sum of fields that would need to be changed to yield an acceptable record by solving a mixed integer programming problem known as the fixed charge problem. While this formulation can and has been solved to find an optimal solution to the FTIP, this approach can be expensive in terms of solution time. In this paper, we demonstrate the use of a heuristic procedure to find an approximately optimal solution to FTIP. This procedure uses the SWIFT algorithm developed by Walker in conjunction with a judicious choice of dummy variable costs to arrive at an approximate solution based on a linear programming solution. We will show that this solution is optimal in many cases. We will also discuss the use of the special structure of FTIP to arrive at an optimal solution to the LP problem.

Keywords: Heuristic Procedure; Balance Constraint; Artificial Variable; Mixed Integer Programming Problem; Mathematical Programming Formulation (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-9464-8_41

Ordering information: This item can be ordered from
http://www.springer.com/9781461394648

DOI: 10.1007/978-1-4613-9464-8_41

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().