At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
DO YOU KNOW HOW TO DO THIS YET? I SAW THAT YOU WERE BEING TOLD TO PLUG IN EARLIER BUT WAS NOT PROPERLY TAUGHT THE CONCEPTS BEHIND THESE THINGS
I'm not really sure how to do this @Michele_Laino
I'm sorry, I'm not good with linear programming
since I never studied that subject!
what was the answer when you did it? or you didnt figure that out?
I'm not very good at these. Do you know how to do them?
i believe linear programming is a graphical boundary setup and examines the vertixes (corners created by intersections)
try wolframalpha.com it does it and then shows you the steps...
@amistre64 How do I figure out if it is infeasable, unbounded, an optimal solution, or alternate optimal solutions?
well, i would graph the constraints ... but im still trying to get a better grasp on what is being asked. |dw:1443898656805:dw|
@hwyl Help pleaseeee
(-inf,inf) is one 'corner' (-inf,0) is one 'corner' (1,0) is a corner and (1,2) is a corner but there is usually some function that these constraints can be compared with, it represents a surface that caps the xy plane
Ok so how do I come to an answer choice?
i dont know, i could be misreading the info, but it seems incomplete to me. https://www.youtube.com/watch?v=M4K6HYLHREQ
It is incomplete.
personally, i think the (-inf,inf) makes it unbounded ... but i cant say for sure since I am many years removed from the definitions
@roast_master_says Incomplete is not an answer choice. Is it unbounded?
it should be noted that a region with infinity as a vertex point is not a guarentee that the system is unbounded. for some reason
THEY'RE ALL DEFINITIONS INFEASIBLE WOULD BE NO 'FEASIBLE' OR POSSIBLE SOLUTION UNBOUNDED WOULD HAVE NO BOUNDS AND COULD EITHER BE NEGATIVE INFINITY OR POSITIVE INFINITY SO, THERE ARE THREE POSSIBLE SOLUTIONS INFEASIBLE UNBOUNDED OPTIMAL (FEASIBLE)
So it's unbounded??
UNBOUNDED, LIKE AMISTRE SAID, JUST FOR CLARIFICATION REFERS TO THE UNBOUNDED REGION, BUT DOES NOT REFER TO THE LINEAR PROGRAM BEING UNBOUNDED
Oh so it's optimal?
the question where you pluggd in numbers was completely different than this one anywyz i hope you understand th concepts this time.
How do I figure out if it's infeasible or optimal?