Example: biology
9.1 Introduction to Integer Programming

9.1 Introduction to Integer Programming

Back to document page

9.1 Introduction to Integer Programming An IP in which all variables are required to be integers is called a pure integer pro gramming problem. For example, max z = 3x\ + 2x2 s.t. x, + .v2 ^ 6 (1) .v,, x2 2= 0, xu x2 integer is a pure integer programming problem.

  Introduction, Programming, Gramming, Pro gramming

Download 9.1 Introduction to Integer Programming


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries