feasible region

feasible region : In optimization (a branch of mathematics), a candidate solution is a member of a set of possible solutions to a given problem. A candidate solution does not have to be a likely or reasonable solution to the problem. The space of all candidate solutions is called the feasible region, feasible set, search space, or solution space. In the case of the genetic algorithm, the candidate solutions are the individuals in the population being evolved by the algorithm. eo:Kandidata solvaĵo nl:Toegelaten gebied..   More from Wikipedia

feasible region : Candidate Submittal is an alternative recruitment process offered by companies whereby the candidate submittal agency provides 'coaching' for the job seeker with respect to his/her job application. With candidate submittal, the job seeker usually sources their own prospective job opportunity ( eg...   More from Wikipedia

  1st half of a problem dealing with linear programming restrictions (constraints) and demands. This problems also identifies the vertices of the common shaded regaion (feasible region) and identifies the maximum profit by using the relavent objective function. ... MrLovellForde

  , with new entries added daily. The graph of a linear equation is a straight line. The graph of a linear inequality is the half of the plane to one side of the line. The solution of a system of inequalities is the set intersection of the regions for each inequality. It may be the empt... Contributed by: Ed Pegg Jr ... wolfram mathematica demonstrations interactive visualization feasible region inequality plot linear programming solution set space system of equations free math computer science ...

Question : A shop makes tables and chairs. Each table takes 8 hours to assemble and 2 hours to finish. Each chair takes 3 hours to assemble and 1 hour to finish. The assemblers can work for at most 200 hours each week, and the finishers can work for at most 60 hours each week. The shop wants to make as many tables and chairs as possible. Write the constraints for the problem, and graph the feasible region. Let t be the number of tables and c be the number of chairs.

Answer : Okay, I think constraints are 8t+3c<=200 and 2t+c<=60, t>=0 and c>=0. SO, now you have to find corners. One corner is solving for 8t+3c=200 and 2t+c=60. You get t=10 and c=40 with a total of 10+40=50. Now other corner is c=0, so at most t=25, so total 25+0=25. And other corner is t=0, so at most c=60, so total is 60+0=60. SO if you want maximum total, then its 60 I think. I hope that helps...   More from Yahoo Answers

Question : class that can be offered? Also what about the corner points? If the Math dept offers two courses Finite and Applied Calc. Each section of Finite Math has 60 students and each section of Applied Calc has 50. The dept is allowed to offer up to 110 sections. Furthermore no more than 6000 students want to take a math course and no student can register for more than one. I understand LP im just a little confused on word problems and the constraints

Answer : To model an optimization problem first find out the optimization function and the variables, on which the objective depends on. I can't get the objective function from your question. But i think you've got two variables describing the problem x - the number of sections in finite math y - the number of sections in applied calculus The upper limits are the total number of section shall not exceed 110: x + y 110 the total number of students does not exceed 6000 60 x + 50 y 6000 (because no student can register for more than one of the courses, you can simply add the number of students) The number has lower limits, too. Because a negative number of sections makes no sense, you have the restrictions x 0 y 0 You can rearrange to (i) y 110 - x (ii) y 120 - 1.2 x (iii) x 0 (iv) y 0 Make a sketch, and you find a feasible with four vertices. One is the origin P1=(0;0) Two are the axis intercepts of the boundary lines given by (....   More from Yahoo Answers

Looking for More Help!

Type Your Question Here