Answers.com > Wiki Answers > Categories > Jobs & Education > Education > School Subjects > Math and Arithmetic > How do you find constraints in Linear Programming?

How do you find constraints in Linear Programming?

In: Math and Arithmetic, Algebra [Edit categories]

Answer:

first find out if it is congruent if it isn't congruent you can find the constraints

First answer by Babygirl13b. Last edit by Babygirl13b. Contributor trust: 0 [recommend contributor ]. Question popularity: 1 [recommend question].

[report abuse]

Can you answer these Math and Arithmetic questions?

	What is a solid consisting of two polygons which are parallel to each other and all points between them?	Answer it!
	How many calories do you need to raise the temperature of 1 litter of air 1 degree c?	Answer it!
	What is the approximate caloric equivalent of 1 MET?	Answer it!
	What kind of triangle has rotational symmetry?	Answer it!
	How many hours of day light is on the moon?	Answer it!

How do you find the objective function for linear programming?
the variable you want to maximise or minimise (P) = each variable times the amount of P the contribute e.g. maximise money earned x=£3 y=£2.50 z=£4 (MAX)P=3x+2.5y+4z is the objective function
What is the theoretical limit on the number of constraints on a linear programming problem?
There is no limit.
How do you find the rule for a linear function?
y=ax+b a=slopeb=y intercept
What is the feasible region in linear programming?
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...
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...