0
first find out if it is congruent if it isn't congruent you can find the constraints
Wiki User
∙ 13y ago
Add your answer:
Earn +20 pts
What are the components of linear programming?
A linear objective function and linear constraints.
What are the scope of linear programming?
Linear programming can be used to solve problems requiring the optimisation (maximum or minimum) of a linear objective function when the variables are subject to a linear constraints.
What is the theoretical limit on the number of constraints on a linear programming problem?
There is no limit.
What is non linear programming problem?
It is a programming problem in which the objective function is to be optimised subject to a set of constraints. At least one of the constraints or the objective functions must be non-linear in at least one of the variables.
What is the minimum number of constraints a linear programming problem can have?
One. To be a (non-trivial) linear programming problem both the objective function and the constraints must be linear. If there were no constraints then the objective function could be made arbitrarily large or arbitrarily small. (Think of a line in two-space.) By adding one constraint the objective function's value can be limited to a finite value.
What are the components of linear programming?
A linear objective function and linear constraints.
What are the components of programming?
A linear objective function and linear constraints.
What are the components of linear programming models?
The objective function and the constraints.
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 are the scope of linear programming?
Linear programming can be used to solve problems requiring the optimisation (maximum or minimum) of a linear objective function when the variables are subject to a linear constraints.
What is the importance of linear programming?
It allows you to maximise or minimise objective functions, subject to constraints that are linear.
What is the theoretical limit on the number of constraints on a linear programming problem?
There is no limit.
What is non linear programming problem?
It is a programming problem in which the objective function is to be optimised subject to a set of constraints. At least one of the constraints or the objective functions must be non-linear in at least one of the variables.
To solve a linear programming problem with thousands of variables and constraints?
a mainframe computer is required
What is the minimum number of constraints a linear programming problem can have?
One. To be a (non-trivial) linear programming problem both the objective function and the constraints must be linear. If there were no constraints then the objective function could be made arbitrarily large or arbitrarily small. (Think of a line in two-space.) By adding one constraint the objective function's value can be limited to a finite value.
Can you use differential equations in linear programming?
I'm not altogether clear about what you mean. However, the term 'linear programming' means a category of optimisation problems in which both the objective function and the constraints are linear. Please see the link.
What is infeasibility in linear programming?
It is the rejection of parts of the space which is formed by the decision variables and which is disallowed because of one or more of the linear constraints are not satisfied.
