If there are two points where an objective function is optimized, what can be said about the linear programming problem? The feasible region has only two vertices. Two of the constraints are parallel to each other. The feasible region contains the origin (0, 0). The objective function is parallel to one of the constraints.
@texaschic101
@perl
Do you have any notes on linear programming problems?
hold up
http://hspm.sph.sc.edu/Courses/J716/pdf/716-10%20Linear%20Programming%20I.pdf
Its ok if you dont know :/
You want to minimize (or maximize) a particular function of several unknowns called the *objective* function, subject to a collection of inequalities called *constraints*. For linear programming, the constraints are a linear function of the unknowns. "
im going to do an example which has multiple solutions, one moment
ok
this is an example with more than one solution: Max 6X + 4y subject to: X + 2y <= 16 3X + 2y <= 24 all decision variables >= 0.
x=0?
>0 does not work :(
so The only solid answer would be A
nah not A
There are parallel constraints
right, it looks like 6x + 4y is parallel to 3x + 2y
yea It does
If there are two points where an objective function is optimized
In some instances, the objective function will be parallel to one of the constraint lines that forms a boundary of the feasible solution space. When this happens, every combination of x1 and x2 on the segment of the constraint line that touches the feasible solution space represents an optimal solution. Hence, there are multiple optimal solutions to the problem.
so the answer is D
Join our real-time social learning platform and learn together with your friends!