Mixed-integer linear fractional programming (MILFP)

From optimization
Revision as of 12:02, 5 June 2015 by Hhs448 (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Author: Ho-Hyun Sun Steward: Dajun Yue, Fengqi You

Introduction

Mixed-integer linear fractional programming (MILFP) is a category of mixed-integer linear programming (MILP). It is similar to MILP in that it uses the branch and bound approach. It is widely used in process engineering for optimizing a wide variety of production processes ranging from petroleum refinery to polymerization processses and may even be applied to evaluation of life-cycle assessment (LCA). The unique characteristic about MILFP is that it is a non-convex MILP where the objective function to be optimized is a ratio of two linear functions and the constraints are linear </ref>. It can contain both continuous and discrete varaibles. Despite its categorization as a mixed-integer linear programming, it has characteristics of pseudoconvex/pseudoconcave objective functions, which makes optimizing to global optimal a difficult task. However, this can be solved by making into an equivalent MILP.