Base-2 Expansions for Linearizing Products of Functions of Discrete Variables

被引:19
作者
Adams, Warren P. [1 ]
Henry, Stephen M. [2 ]
机构
[1] Clemson Univ, Dept Math Sci, Clemson, SC 29634 USA
[2] Sandia Natl Labs, Syst Readiness & Sustainment Technol Grp, Albuquerque, NM 87123 USA
基金
美国国家科学基金会;
关键词
SUPERIOR REPRESENTATION METHOD; GLOBAL OPTIMIZATION; DESIGN;
D O I
10.1287/opre.1120.1106
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper presents an approach for representing functions of discrete variables, and their products, using logarithmic numbers of binary variables. Given a univariate function whose domain consists of n distinct values, it begins by employing a base-2 expansion to express the function in terms of the ceiling of log(2) n binary and n continuous variables, using linear restrictions to equate the functional values with the possible binary realizations. The representation of the product of such a function with a nonnegative variable is handled via an appropriate scaling of the linear restrictions. Products of m functions are treated in an inductive manner from i = 2 to m, where each step i uses such a scaling to express the product of function i and a nonnegative variable denoting a translated version of the product of functions 1 through i - 1 as a newly defined variable. The resulting representations, both in terms of one function and many, are important for reformulating general discrete variables as binary, and also for linearizing mixed-integer generalized geometric and discrete nonlinear programs, where it is desired to economize on the number of binary variables. The approach provides insight into, improves upon, and subsumes related linearization methods for products of functions of discrete variables. Subject classifications: programming: integer, nonlinear, theory: Area of review: Optimization. History: Received January 2011; revision received July 2011; accepted October 2011. Published online in Articles in Advance November 20, 2012.
引用
收藏
页码:1477 / 1490
页数:14
相关论文
共 16 条
[1]   A simple recipe for concise mixed 0-1 linearizations [J].
Adam, WP ;
Forrester, RJ .
OPERATIONS RESEARCH LETTERS, 2005, 33 (01) :55-61
[2]   Global optimal structures of heat exchanger networks by piecewise relaxation [J].
Bergamini, Maria L. ;
Scenna, Nicolas J. ;
Aguirre, Pio A. .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 2007, 46 (06) :1752-1763
[3]   Digital circuit optimization via geometric programming [J].
Boyd, SP ;
Kim, SJ ;
Patil, DD ;
Horowitz, MA .
OPERATIONS RESEARCH, 2005, 53 (06) :899-932
[4]   A review of recent advances in global optimization [J].
Floudas, C. A. ;
Gounaris, C. E. .
JOURNAL OF GLOBAL OPTIMIZATION, 2009, 45 (01) :3-38
[5]   IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS [J].
GLOVER, F .
MANAGEMENT SCIENCE, 1975, 22 (04) :455-460
[6]  
Glover F., 1984, Journal of Information and Optimization Sciences, V5, P469
[7]   Numerical and environmental, considerations on a complex industrial mixed integer non-linear programming (MINLP) problem [J].
Harjunkoski, I ;
Westerlund, T ;
Pörn, R .
COMPUTERS & CHEMICAL ENGINEERING, 1999, 23 (10) :1545-1561
[8]  
Kallrath J, 2003, NONCONVEX OPTIM, V74, P237
[9]   A Superior Representation Method for Piecewise Linear Functions [J].
Li, Han-Lin ;
Lu, Hao-Chun ;
Huang, Chia-Hui ;
Hu, Nian-Ze .
INFORMS JOURNAL ON COMPUTING, 2009, 21 (02) :314-321
[10]   Global optimization of a combinatorially complex generalized pooling problem [J].
Meyer, CA ;
Floudas, CA .
AICHE JOURNAL, 2006, 52 (03) :1027-1037