how to minimize objective fcn, given corners of feas. region

[soccer goddess]

ok...my lesson wants me to minimize each objective function subjest to the constraints represented by the feasible region on my graph. i cannon post the graph so here is the description...the constraints represented are (0,6), (1,4), (3,1), and (8,0). my book wants me to minimize the objective function of z=5x+3y. i cannot figure out how to even begin. any help would be GREATLY appreciated! thanks

 

[stapel]

i cannot figure out how to even begin.

To "minimize" ("find the smallest value of") the objective function, follow the process they showed in your book, and pick the input that gives you the smallest value.

If you don't have your book and can't find your class notes, you can review the process here:

. . . . .Google results for "system linear inequalities"

. . . . .Google results for "linear programming introduction"

. . . . .Google results for "maximum minimum feasibility region"

If, after studying at least two resources, you have difficulty in completing this exercise, you will then be able to reply with a clear listing of your work and reasoning so far. Thank you!

Eliz.

 

[galactus]

Here's a start. You are given the data points. Plug them into your equation and see which gives the smallest value.