alleryStart learning →A linear programming problem optimizes which kind of function?
AA quadratic function under circular limits
BA linear function under linear constraints
CA trigonometric function under no limits
DA cubic function under linear equalities only
Answer & Solution
Correct answer: B. A linear function under linear constraints
Linear programming maximizes or minimizes a linear objective function subject to linear constraints.
Keep practising Linear Inequalities
Browse all Linear Inequalities questions for CA Foundation, or explore more Quantitative Aptitude topics.
Related questions
For positive a < b, the natural logarithms ln a and ln b compare how?Replacing the equals sign in 2x + 3 = 9 by < gives what?Written with a less-than-or-equal sign, the inequality x ≥ 3 becomes which?Maximize 2x + 3y subject to x ≥ 0, y ≥ 0, x + y ≤ 4. What is the maximum value?A firm maximizes profit 3x + 2y subject to x + y ≤ 10. Which expression is the objective fWhat is the common solution of the pair x > 2 and x < 5?Which inequality is true for every real number x?For real x, which inequality has no solution?