Download
1 / 7
90 likes | 319 Views
Integer linear programming. Optimization problems where design variables have to be integers are more difficult than ones with continuous variables. The degree of difficulty is particularly damaging for large number of variables:
E N D
Integer linear programming • Optimization problems where design variables have to be integers are more difficult than ones with continuous variables. • The degree of difficulty is particularly damaging for large number of variables: • With continuous variables finding a local optimum increases linearly or quadratically with the number of variables. • With integer variables it can increase exponentially (or non-polynomially): These problems are NP-hard. • Problems with linear objective and linear constraints (Linear programming) are easier to solve. • Furthermore: They do not have optima that are local but not global.
Formulation • The standard form of an integer programming problem is • Algorithm papers often limit themselves to standard form, but software usually allows the more general form
Example Maximize fun time so that you make at least $75 and do not spend more than two hours.
Example Formulation Only two variables are likely to be non-zero. Which do you expect them to be?
Continuous solution from Solver • Without integer constraint, solution does not have to be integer
Integer solution • Will rounding work?
Integer problems in laminate design • When ply angles are unrestricted we have he restriction of integer number of plies. • Most points on the Miki diagram are accessible, but with specific ply angles. • When angles are limited to a small set, together with integer number of plies, we are limited to a finite number of points on diagram. • We will investigate which laminate design problems can be cast as linear integer programming. • Some times it requires some ingenuity.
