Math Linear Programming Multiple Choice Questions with Answers – PDF Download

The overall goal stated as to represent the function of decision variable is best classified as

1. subset function
2. objective function
3. functional modeling
4. programmed module

The factors such as limitations of resources and all the conditions imposed by setting of problem are classified as

1. proportional constraints
2. unstructured constraints
3. structural constraints
4. non-negativity constraints

The non-negativity constraints implies that decision variable's will

1. not be negative
2. not be positive
3. must be positive
4. must be negative

The conditions needed to solve objective function and that are to be satisfied in linear programming are classified as

1. unsolved objectives
2. solved objectives
3. programming requirements
4. subset objectives

The types of constraints to maximize or minimize linear objective function does not include

1. structural constraints
2. non-negativity constraints
3. proportional constraints
4. none of above