answersLogoWhite

0

is a solution in which all the constrains and variables are violated

User Avatar

Wiki User

11y ago

What else can I help you with?

Related Questions

Definition of basic feasible solution?

feasible solution


What is the difference between feasible solution and basic feasible solution?

optimal solution is the possible solution that we able to do something and feasible solution is the solution in which we can achieve best way of the solution


What is the difference between feasible and optimal solution?

The optimal solution is the best feasible solution


State the difference between a feasible solution basic feasible solution and an optimal solution of a lpp?

the optimal solution is best of feasible solution.this is as simple as it seems


What is feasible solution?

is a solution in which all the constrains and variables are violated


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 part of an inequality graph represents the solution?

The Feasible Region


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 the Basic feasible solution Please Define.X 2 4 6 8 10 12Y 5 7 15 4 2 1?

Define the Basic feasible solution


Non-degenerate basic feasible solution?

A non-degenerate basic feasible solution in linear programming is one where at least one of the basic variables is strictly positive. In contrast to degenerate solutions where basic variables might be zero, non-degenerate solutions can help optimize algorithms as they ensure progress in the search for the optimal solution.


What is the feasible solution?

AN 'n' dimensional point x1,x2,----------------xn is said to be a feasible solution to the given LPP. if satisfies not only the set of all constraints but even the non-negative restrictions.


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.