Linear Programming Basics

To achieve the best outcome in a mathematical model with linear relationships (correct)

To optimize a non-linear objective function

To find the intersection of finitely many half spaces

To solve non-linear equations

As a convex polytope, the intersection of finitely many half spaces (correct)

As the solution set to non-linear equations

As the entire space of possible solutions

As a non-convex polygon

Trigonometric function

Exponential function

Quadratic function

Real-valued affine (linear) function (correct)

<p>$\text{Find a vector } \mathbf{x} \text{ that maximizes } \mathbf{c}^{\mathsf{T}}\mathbf{x} \text{ subject to } A\mathbf{x} \leq \mathbf{b} \text{ and } \mathbf{x} \geq \mathbf{0}$</p> Signup and view all the answers

<p>A point in the polytope where the objective function has the largest (or smallest) value if such a point exists</p> Signup and view all the answers