Mathematical programming is Turing-complete We define mathematical programming (MP) as a formal language. We then show a MP formulation (of the MINLP class) whose parameters encode the input of a Minsky’s Register Machine (MRM) and whose set of solutions is
Suriya Ruangpattana, Purdue University
Optimal Division of the Load Duration Curve for Managing Fuel Diversification Fuel Diversification (FD) is important in managing the cost of electricity generation. Past studies have modeled the FD problem without explicit considerations of the load duration curve (LDC) thus
Pietro Belotti, Lehigh University
TBD
Jim Ostrowski, University of Waterloo
Formulations for the Unit Commitment Problem The Unit Commitment (UC)problem determines the optimal production schedule for power generator in a given region. Typically, UC problem instances are very large and have non-linear objective functions. In this talk, we discuss the
Jon Lee, IBM Research
Parametric nonlinear discrete optimization I will describe recent results on optimizing f(Wx) over x in a well-described set of integer points. The motivation is multi-objective optimization, where f balances linear functions described by the rows of W. Usually we assume
Ted Ralphs, Lehigh University
Mixed Integer Bilevel Programming A bilevel program is a generalization of a standard mathematical program in which we consider a hierarchical decision system with two independent decision makers whose interests are not necessarily aligned. We first discuss the importance and
Stefan Vigerske, Humboldt University Berlin
Extending SCIP for MINLP We present extensions of the constraint integer programming framework SCIP for solving mixed-integer nonlinear programs. Nonlinear constraints (convex or nonconvex) are handled within an LP-based branch-and-cut algorithm by generating suitable linear relaxations and by domain propagation.
C.H. Jeffrey Pang, Fields Institute
Level set methods for finding critical points of mountain pass type In computational chemistry and differential equations, we often seek a critical point of a function by finding a ?mountain pass? between two given points: a connecting path along which
Pall Jensson, University of Iceland
On-line bin covering algorithms On-line Bin Covering Algorithms In food processing items of irregular sizes are frequently collected and packed into bins with portions of a specified minimal size, i.e. a target weight. The purpose of this study is to
Zong Woo Geem, Johns Hopkins University
The harmony search algorithm Harmony search is a newly-developed meta-heuristic optimization algorithm, which was inspired by music improvisation, for both discrete and continuous optimization. The harmony search algorithm has been applied to various problems such as music composition, Sudoku puzzle