Difference between revisions of "Facility location problems"

From optimization
Jump to: navigation, search
Line 2: Line 2:
 
Stewards: Dajun Yue and Fengqi You
 
Stewards: Dajun Yue and Fengqi You
  
[[File:johnny.jpg|thumb|right|350px|John von Neumann [1]]]
+
[[File:johnny.jpg|thumb|right|350px|MILP [1]]]
  
  
 +
The facility location problem deals with selecting the location of a facility from a list of integer possibilities to best meet demand wether to the next line of customers. Goal here is to most efficiently serve the constraints demanded while doing so at the lowest cost.
  
=History=
+
==History==
  
=Description and Formulation=
+
==Description and Formulation==
  
  
=Solution Methods=
+
==Solution Methods==
  
=Examples and Applications=
+
==Examples and Applications==
  
  
=Conclusion=
+
==Conclusion==
  
=References=
+
==References==

Revision as of 19:39, 24 May 2015

Author: Aaron Litoff
Stewards: Dajun Yue and Fengqi You

MILP [1]


The facility location problem deals with selecting the location of a facility from a list of integer possibilities to best meet demand wether to the next line of customers. Goal here is to most efficiently serve the constraints demanded while doing so at the lowest cost.

Contents

History

Description and Formulation

Solution Methods

Examples and Applications

Conclusion

References