Answer:
d. An optimal solution to linear programming problem can be found at an extreme point of the feasible region for the problem.
Step-by-step explanation:
A feasible solution satisfies all the constraints of the problem in linear programming. The constraints are the restrictions on decision variable. They limit the value of decision variable in linear programming. Optimal solutions occur when there is feasible problem in the programming.
Answer:
Step-by-step explanation:
x^2 - 9x + 14
(x - 7)(x - 2)
Answer:
Step-by-step explanation:
The slope-intercept form of an equation of a line:
<em>m</em><em> - slope</em>
<em>b</em><em> - y-intercept (0, b)</em>
The formula of a slope:
From the graph we have two points (0, 4) → <em>b = 4</em>, and (3, 5).
Calculate the slope:
If you want the equation of a line, then put the value of <em>m</em> and <em>b</em> to the equation of a line: