Which statement correctly distinguishes linear programming from integer programming?
Correct answer: B. Linear programming permits fractional decision-variable values
- A. Linear programming always has integer coefficients
- B. Linear programming permits fractional decision-variable values
- C. Integer programming has no objective function
- D. Integer programming excludes all constraints
Explanation
Standard linear programming permits fractional values unless additional integrality restrictions are imposed. Integer programming requires some or all decision variables to take whole-number values.
Report an error
The more specific you are, the faster it gets fixed. A source beats an opinion.
Prefer email? [email protected]
About Linear Programming
Linear programming models the maximum or minimum of an objective function subject to linear constraints. Questions involve translating word conditions into inequalities, drawing the feasible region, identifying corner points and evaluating the objective function, including cases involving non-negativity restrictions and redundant constraints.
Practise Linear Programming
30 free Linear Programming MCQs from Quantitative Methods, each with the correct answer and an explanation. Unlimited attempts, no account needed.
Discussion
Stuck on an option, or know a faster way to get there? Ask or explain it here.
No comments yet. Be the first to explain this one.
Exams that ask Quantitative Methods questions like this
Quantitative Methods is on this paper prepared for on TestUstad, and all of them draw the same bank, so this question is worth knowing for it.
More Linear Programming questions
What does the shadow price of a resource constraint represent in a linear programming model?
In a minimization linear programming problem, the feasible region is commonly located on which side of a constraint such as 2x + y ≥ 8?
Consider the problem of maximizing Z = 4x + 3y subject to x + y ≤ 5, x ≤ 3, y ≤ 4, and x, y ≥ 0. What is the optimal value of Z?
A bakery makes cakes and loaves. Each cake uses 2 hours of labour and each loaf uses 1 hour. If at most 40 labour hours are available, which inequality represents this resource limit?
Which assumption of linear programming allows decision variables to take fractional values?
What is the main purpose of introducing an artificial variable in the simplex method?