linear programming review

Today in class we reviewed the problems we did before break on Wednesday, Thursday and Friday. Some important things to know that are examples from the lego problem and computer problem (both linear programming) are: objective function-there is always an objective,what you are trying to figure out or accomplish, an equation ex.lego- p=16t + 10c converts in to Z=16 x1 + 10x2 (x little one/ x little two) constraint-limits, almost always the problems we will be given will have a limit ex. how many legos they will ship us or how many computers you can make in a day feasible solution-something possible, there may only be one but they is often many in the problems we are given, does NOT have to be the best solution ex. 3 tables 0 chairs in the lego problem or 0 computers made are both solutions possible with the resources given. optimal solution-the best solution, NOT the amount of $ you made in profit ex. 3 tables and 1 chair made from legos there is not always going to be only two variables x1 and x2. There can be an infinite number of decision variables. non negativity is important to pay attention to as well when we are given limits. ex #37 pg 2-10. x1,x2,x3, and x4 are all greater than or equal to 0