answersLogoWhite

0


Best Answer

Linear programming is just graphing a bunch of linear inequalities. Remember that when you graph inequalities, you need to shade the "good" region - pick a point that is not on the line, put it in the inequality, and the it the point makes the inequality true (like 0

User Avatar

Wiki User

โˆ™ 2009-07-18 17:25:06
This answer is:
๐Ÿ™
0
๐Ÿคจ
0
๐Ÿ˜ฎ
0
User Avatar
Study guides

Algebra

20 cards

A polynomial of degree zero is a constant term

The grouping method of factoring can still be used when only some of the terms share a common factor A True B False

The sum or difference of p and q is the of the x-term in the trinomial

A number a power of a variable or a product of the two is a monomial while a polynomial is the of monomials

โžก๏ธ
See all cards
3.71
โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…โ˜†โ˜…
358 Reviews

Add your answer:

Earn +20 pts
Q: What is the feasible region in linear programming?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Is it possible for a linear programming problem to have no solution?

Yes. There need not be a feasible region.


What is the feasible region of a linear programming problem?

After graphing the equations for the linear programming problem, the graph will have some intersecting lines forming some polygon. This polygon (triangle, rectangle, parallelogram, quadrilateral, etc) is the feasible region.


Distinguish between integer programming problem and linear programming problem?

Integer programming is a subset of linear programming where the feasible region is reduced to only the integer values that lie within it.


What is optimal feasible solution?

It is usually the answer in linear programming. The objective of linear programming is to find the optimum solution (maximum or minimum) of an objective function under a number of linear constraints. The constraints should generate a feasible region: a region in which all the constraints are satisfied. The optimal feasible solution is a solution that lies in this region and also optimises the obective function.


What is optimal solution?

It is usually the answer in linear programming. The objective of linear programming is to find the optimum solution (maximum or minimum) of an objective function under a number of linear constraints. The constraints should generate a feasible region: a region in which all the constraints are satisfied. The optimal feasible solution is a solution that lies in this region and also optimises the obective function.


Can a linear programming problem have multiple solutions?

Yes. If the feasible region has a [constraint] line that is parallel to the objective function.


What is the definition of the solution of linear inequalities?

Each linear equation is a line that divides the coordinate plane into three regions: one "above" the line, one "below" and the line itself. For a linear inequality, the corresponding equality divides the plane into two, with the line itself belonging to one or the other region depending on the nature of the inequality. A system of linear inequalities may define a polygonal region (a simplex) that satisfies ALL the inequalities. This area, if it exists, is called the feasible region and comprises all possible solutions of the linear inequalities. In linear programming, there will be an objective function which will restrict the feasible region to a vertex or an edge of simplex. There may also be a further constraint - integer programming - where the solution must comprise integers. In this case, the feasible region will comprise all the integer grid-ponits with the simplex.


What is degeneracy in linear programing problem?

the phenomenon of obtaining a degenerate basic feasible solution in a linear programming problem known as degeneracy.


Is it possible that there will be no feasible solutions in linear programming?

Yes. Although possible in real life, it is unlikely in school examples!


What is the definition of unbounded region?

definition feasible region definition feasible region


Why are integer programming problems more difficult to solve than linear programming problems?

In both cases the constraints are used to produce an n-dimensional simplex which represents the "feasible region". In the case of linear programming this is the feasible region. But that is not the case for integer programming since only those points within the region for which the variables are integer are feasible.The objective function is then used to find the maximum or minimum - as required. In the case of a linear programming problem, the solution must lie on one of the vertices (or along one line in 2-d, plane in 3-d etc) of the simplex and so is easy to find. In the case of integer programming, the optimal solution so found may contain one or more variables that are not integer and so it is necessary to examine all the points in the immediate neighbourhood and evaluate the objective function at each of these points. This last requirement makes integer programming solutions more difficult to find.


What do you understand by linear programming problem?

1. What do you understand by Linear Programming Problem? What are the requirements of Linear Programming Problem? What are the basic assumptions of Linear Programming Problem?


Why a feasible region is the unshaded region?

i know that a feasible region, is the region which satisfies all the constraints but i don't know exactly why is the unshaded region regarded as a feasible region instead of the shaded region.


Define linear programming?

necessity of linear programming on organization.


How do you get a feasibility region linear programming?

A feasible region is, in a constrained optimization problem, the set of solutions satisfying all equalities and/or inequalities. On the other hand a linear programming is a constrained optimization problem in which both the objective function and the constraints are linear, therefore a feasible region on a linear programming problem is the set of solutions of the a linear problem. Many algorithms had been designed to successfully attain feasibility at the same time as resolving the problem, e.g. reaching its minimum. Perhaps one of the most famous and extensively utilized is the Simplex Method who travels from one extremal point to another, which happens to be the possible extrema given the convex nature of the problem, by maintaining a fixed number of components to zero, called basic variables. Then, the algorithm arrives to a global minimum generally in polinomial time even if its worst possible case has already been proved to be exponencial, see Klee-Minty's cube.


What is the maximum value of 3x plus 3y in the feasible region?

It would depend on the feasible region.


What are examples of feasible region?

the feasible region is where two or more inequalities are shaded in the same place


What is the significance of duality theory of linear programming Describe the general rules for writing the dual of a linear programming problem?

the significance of duality theory of linear programming


What has the author Shinji Mizuno written?

Shinji Mizuno has written: 'Determination of optimal vertices from feasible solutions in unimodular linear programming' -- subject(s): Accessible book


What is the minimum value of 6x plus 5y in the feasible region?

Since there is no feasible region defined, there is no answer possible.


Will points in a feasible region be a solution to the real-world problem it represents?

Yes they will. That is how the feasible region is defined.


What are the essential characteristics of linear programming problem?

essential attributes of linear programming models and its uses


What are the components of linear programming?

A linear objective function and linear constraints.


What is the minimum value of 6x 8y in the feasible region?

The answer depends on what the feasible region is and on what operator is between 6x and 8y.


What is the difference between linear and integer programming?

Integer programming is a method of mathematical programming that restricts some or all of the variables to integers. A subset of Integer programming is Linear programming. This is a form of mathematical programming which seeks to find the best outcome in such a way that the requirements are linear relationships.