Which of the following statement is not true? A. We can get the optimal solution for IP by rounding the optimal solution for LP. B. IP is an extension of LP in which some or all of the decision variables are constrained to be an integer. C. There are three types of IP. They are Pure IP, Mixed IP, and Binary IP. D. The binary variable takes on values of 0 or 1.
A.
We can get the optimal solution for IP by rounding the optimal solution for LP.
B.
IP is an extension of LP in which some or all of the decision variables are constrained to be an integer.
C.
There are three types of IP. They are Pure IP, Mixed IP, and Binary IP.
D.
The binary variable takes on values of 0 or 1.
Linear Programming
It is a mathematical modelling technique where the linear function is maximized or minimized subject to various constraints.
Integer Programming:
It is a mathematical optimization problem, an extended version of the linear programming where some or all the variables are restricted to be the integers.
There are three types of integer programming models,
Mixed integer programming models
Pure integer programming models
Binary integer programming models
The binary programming integer models take on the values of 0 and 1.
Step by step
Solved in 2 steps
