Hellow guys, Welcome to my website, and you are watching Lec-6 Basic Feasible Solution || Basic & Non-Basic variables || Linear Programming In Hindi & Urdu. and this vIdeo is uploaded by Hafi Academy at 2023-03-16T12:13:59-07:00. We are pramote this video only for entertainment and educational perpose only. So, I hop you like our website.
| Name | Lec-6 Basic Feasible Solution || Basic & Non-Basic variables || Linear Programming In Hindi & Urdu |
| Video Uploader | Video From Hafi Academy |
| Upload Date | This Video Uploaded At 16-03-2023 15:13:59 |
| Video Discription | #Hafi_Academy Basic Solution in LPP | Basic Feasible Solution | Basic & Non-Basic variables | Linear Programming Assalam O Alikum! A linear programming problem (LPP) is a mathematical optimization model that seeks to maximize or minimize a linear objective function subject to a set of linear constraints. The basic solution of an LPP refers to a solution that satisfies the constraints and has a non-negative value for all decision variables. A basic solution is obtained by setting a subset of the variables to zero and solving the resulting set of linear equations for the remaining variables. The subset of variables that are set to zero is called the non-basic variables, while the remaining variables are called the basic variables. The number of basic variables is equal to the number of constraints in the LPP. A basic feasible solution is a basic solution that also satisfies the non-negativity constraints on the decision variables. To find a basic solution, we can use the simplex method, which is an algorithm that starts with a basic feasible solution and iteratively improves it until an optimal solution is found. The simplex method operates by moving from one basic feasible solution to another along edges of the feasible region. In summary, a basic solution in LPP is a feasible solution where a subset of the variables is set to zero, and the remaining variables satisfy the constraints and have a non-negative value. The simplex method can be used to find a basic feasible solution, which can then be improved iteratively to find an optimal solution. In this video we will describe the following. . • liner programming • programming model • unique optimal solution • maximize • graphical method • solution of problem • optimal solution • feasible region • inequalities and maximize Thank you for watching Your can also watch following course: ________________________________________________________________ Linear Programming Model https://youtube.com/playlist?list=PLmt6RSMRSBqvXDL2cQLa352Xy6TZs-KvV ________________________________________________________________ Database System https://youtube.com/playlist?list=PLmt6RSMRSBqvvulabgOMghQtdmaF6ZA4p ________________________________________________________________ Data Communication and Networking https://youtube.com/playlist?list=PLmt6RSMRSBqte6WyZ37k6LfiTGaSQTJOe ________________________________________________________________ Programming Fundamental (C++) https://youtube.com/playlist?list=PLmt6RSMRSBqsEJhMeHAOiNddrybXwm1GY ________________________________________________________________ Statistics https://youtube.com/playlist?list=PLmt6RSMRSBqsQvtlgLNDeRU3En_3VW4LL ________________________________________________________________ How to install Computer Software https://youtube.com/playlist?list=PLmt6RSMRSBqtLw3Mm87tXIA_C-ZM_5Enc ----------------------------------------------------------------------------------------------- Hafi Academy https://www.youtube.com/channel/UCfuQaumLHPe5Xa2URSewlfQ subscribe the channel |
| Category | Education |
| Tags | computer science course | Linear Programming | Basic Solution | Feasible Solution | Non-negative Constraints | Decision Variables | Non-basic Variables | Basic Variables | Simplex Method | Optimal Solution. | Optimization | Constraints | Objective Function | Feasible Region | Linear Inequalities | Linear Equations | Duality | Sensitivity Analysis. | Feasibility | Infeasible Solution | Non-negativity Constraints | Unbounded Feasible Region | Dual Simplex Method. |
