The document discusses key concepts in operations research including the objective function, which is maximized or minimized, the optimal solution which achieves this, and decision variables which can be adjusted to find the optimal solution. It also defines a feasible solution as any option within the feasible region defined by constraints, and discusses the simplex and dual simplex methods for solving linear programming problems, where the simplex method starts with a feasible but not optimal solution and dual simplex with an infeasible but optimal starting point.
The document discusses key concepts in operations research including the objective function, which is maximized or minimized, the optimal solution which achieves this, and decision variables which can be adjusted to find the optimal solution. It also defines a feasible solution as any option within the feasible region defined by constraints, and discusses the simplex and dual simplex methods for solving linear programming problems, where the simplex method starts with a feasible but not optimal solution and dual simplex with an infeasible but optimal starting point.
The document discusses key concepts in operations research including the objective function, which is maximized or minimized, the optimal solution which achieves this, and decision variables which can be adjusted to find the optimal solution. It also defines a feasible solution as any option within the feasible region defined by constraints, and discusses the simplex and dual simplex methods for solving linear programming problems, where the simplex method starts with a feasible but not optimal solution and dual simplex with an infeasible but optimal starting point.
A function which is to be maximized or minimized is called objective function.
2-Optimal Solution.? The feasible solution which maximized or minimized the objective function is called the optimal solution. 3-Objective of operation research.? Operation research is used to help decision makers for solving the problems, involving the interaction of various components. 5-Decision Variables.? This is one or more variable quantity. The decision variable presents the decision (such as x1,x2) and any set of specific value that corresponds to a specific decision and is denoted by x. 9-Feasible Solution.? Each point of the feasible region is called a feasible solution of the system of linear inequalities. 4-Dual Simplex method.? In this method the starts from / condition is optimal but infeasible. In the simplex method starts from/ condition is feasible but not optimal. 2-Relationship b/w simplex and dual simplex method.? 1-First we find entering variable 2- Take ratio of column 3- Only positive entries are considered 1-First fine leaving variable 2- take ratio of row 3- ratio only negative enteries