Linear Programming problem learn how to solve

Learn how to solve problems using linear programming. A linear programming problem involves finding the maximum or minimum value of an equation, called the objective functions, subject to a system of inequalities, called the constraints.
To solve a linear programming problem graphically, we graph the individual inequalities making up the constraints of the linear programming problem. The region bounded by the graphs of the inequalities in the constraints is called the feasible region and the vertices of the polygon formed by the feasible region is called the corner points.
The solution to the linear programming problem is the corner point which yields the maximum/minimum value (as the case may be) of the objective function.
#systemsofequations #linearprogramming

[@harrypotter1155]

"You can say no, it's okay. I'll explain it."
What a perfect lecturer you are. You create such a good environment for learners. Thank you, sir.

[@CrabCakes2629]

cannot stress enough how much you saved my ass with this video. Love all your work, dude

[@ethanolol3895]

These videos are perfect for studying for semester finals. Thank you very much!

[@brianmclogan]

you are very welcome!

[@aleahpickett6885]

I will only watch your vids I love you my grades are saved

[@spyrex3988]

That chick was so scared she said "yea"

[@Tyler64883]

hi Brian! do you think you could go over LInear Optimization Models using excel solver

[@hannahfraser5600]

Can someone help me with this question ??? Please
A manufacturer produces 2 types of product. Product A requires 3 units of material, 1 unit of time in fabricating and I unit of time in finishing. Product B requires 1 unit of material, 3 units of time in fabricating and 1 unit of time in finishing. Maximum daily resources are 24 units of material, 30 units of time in fabricating and 12 units of time in finishing. Product A contributes $30 per unit to profit while Product B contributes $40 per unit.
a) State the problem in algebraic form.
b) Graphically solve the problem.
c) Find the optimal solution algebraically and determine the maximum profit.
d) Determine the utilization of resources for the optimal solution.

[@LittleR-uq5rd]

This is way too late but maybe it'll help someone else. Let x be number of productA and y be number of productB.
Maximize:
30x + 40y
------------------------------
Constraints:
3x + y