Find the minimum and maximum values of the objective function subject to the given constraints.
Objective Function: C = 3x + 4y
Constraints: x >= 0, y >= 0, x + y = 5
I am real confused about this stuff, can someone explain this step by step please.......
2007-10-16 15:23:57 · 2 answers · asked by ShaZ 1 in Science & Mathematics ➔ Mathematics
The constraints define a region. In this case, the region is a triangle. In general, the region is a convex polygon.
The goal is to find the point(s) in the region where C takes on the minimum and maximum values.
It is called a linear programming problem because C is a linear function.
Because C is a linear function and the region is a convex polygon, at least one of the vertices (corner points) has to have the maximum C value and at least one of the vertices has to have the minimum C value.
Since the region is a triangle, there are three vertices.
Compute C at each to get three values. The largest will be the max, the smallest the min. (They could all be the same, but in this case, they are three different values)
2007-10-17 17:03:40 · answer #1 · answered by simplicitus 7 · 1⤊ 0⤋
s=2.3x+5y
2015-03-29 16:26:38 · answer #2 · answered by Yvonne 1 · 0⤊ 0⤋