is anyone good with linear programming? :)
im decent
would you mind helping me?
Computer Programming, such as games, and web - then yes.
hahahah, no! linear programming :p
yes i just reviewed it in class
would you mind helping me and explaining? lol
Sure :)
alright! well it gives me this ---> {4x+3y is greater than or equal to 30 x+3y is greater than or equal to 21 x is greater than or equal to 0 y is greater than or equal to 0
I prefer using a graphing calculator
But let me try to explain
alright, it says maximum for c= 5x+8y
its a portfolio I'm doing so it says i need to rewrite the constraints in slope intercept form. idk how to do that :/
Okay you understand what constraints are right?
no.
Constraints are like hm how to explain this.. im going to draw it
is it like when you shade and all the shadings are in the same area if that makes sense?
|dw:1412914494383:dw| so the constraints are x>(greater than or equal to) 0 and y >(greater than or equal to)0 because the graph only stayed in the 1st quadrant
oooh, okay!! so slope intercept form is y=mx+b correct?
yes it is
alright, can you explain to me how you would rewrite it?
Yes but first what is the whole question?
well i have a list of things to do. 1. Rewrite the constraints in slope-intercept form. 2. List all vertices of the feasible region as ordered pairs. 3. List the values of the objective function for each vertex. 4. List the maximum or minimum amount, including the x, and y-value, of the objective function.
Okay i know how to do that so where is the paragraph or the other part of the problem?
4x+3y is greater than or equal to 30 x+3y is greater than or equal to 21 x is greater than or equal to 0 y is greater than or equal to 0 minimum for c=5x+8y thats all i have.
Hm ive never done linear programming with this but i think i get it
alright. i truly don't understand!
Lol okay lets work through this together!
alright! thank you!
Welcome! Now i believe that you got the constraints down
yes, those are the constraints up there! ^^^^
Now your objective function should be 5x+8y
yes. i don't know to to go about converting the constraint into slope intercept form!
you dont need to!
4x+3y >= 30 x+3y >= 21 x >= 0 y >=0 minimum for c=5x+8y thats all i have.
The constraints dont have to be in slope intercept form!
But I would put it into standard form
3y >= -4x + 30 y >= -4/3*x + 30/3 y >= -4/3*x + 10
can you please explain how you got that!
If its in standard form i can teach you the rest easier
you start with this 4x+3y >= 30 subtract 4x from both sides
oh alright so we solve it as if it was an equal sign and get y by its self?
right
the only difference is, if you multiply or divide by a negative, the sign of the inequality will change (but the equality sign won't change)
oooh, alright!! so would that be the slope-intercept form?
correct, after you simplify you should get y >= -4/3*x + 10
similiarly x+3y >= 21 3y >= -x + 21 y >= -1/3*x + 7
then graph the 'feasible' region, that satisfies those 4 inequalities
alright, i think i understand those! so for those, how do i graph them?
you can start at the y intercepts, and then use slope
can i just relace y with like 1 and such?
Dont forget to find the vertices after graphing
can you explain how to graph?
yes when you graph you need to graph your constraints
you can start at the y intercept, then do rise over run to find another point
or you can make a table and pick arbitrary values for x
alrighty
you make a table when you are looking for the max or the min
here is your feasible region. I think you made a typo above in your original inequalities http://www.wolframalpha.com/input/?i=4x%2B3y+%3C%3D+30%2C+x%2B3y+%3C%3D+21%2C+x+%3E%3D+0%2C+y+%3E%3D0+
well when I graphed this "4x+3y is greater than or equal to 30 x+3y is greater than or equal to 21 x is greater than or equal to 0 y is greater than or equal to 0 minimum for c=5x+8y thats all i have." I get this region , and notice that it is infinite http://www.wolframalpha.com/input/?i=4x%2B3y+%3E%3D+30%2C+x%2B3y+%3E%3D+21%2C+x+%3E%3D+0%2C+y+%3E%3D0+
wait so if its that way, what do i do? D:
hmm, i guess you would still have to plug in the corners
you plug the vertices from the feasible region into your objective function
plug in the 'corners'
the corners here to plug into the objective function are (0,10) , (3,6), (21,0)
c(0,10) = 5(0) + 8(10) = 80 c(3,6) = 5(3) + 8(6) = 63 c(21,0) = 5*21 + 8*0 = 105. so x=3, y=6 minimizes the function
thank you so much!! i think i figured out how to do it! thank you so much for your guys help :) <3
Join our real-time social learning platform and learn together with your friends!