FSc Part 2 Mathematics Chapter 5 Short Questions Preparation

Define convex region.

• Ans 1: if the line segment obtained by joining any two points of a region lies entirely within the region, then the region is called convex.

Define the solution region.

• Ans 1: The common region of all the graphs of each of inequality is the system on the same coordinate axes is called the solution region for the system of inequalities.

Define decision variables.

• Ans 1: The variables used in the system of linear inequalities relating to the problems of everyday life are non-negative are called decision variables.

• Ans 1:

Define an objective function.

• Ans 1: A function, which is to be maximized or minimized, is called an objective function.

What are constraints in linear programming ?

• Ans 1: The conditions in the form of linear equations and in-equations are known as constraints.

Check whether the region of graph 2x + 3y > 1 lies on the origin side or not.

• Ans 1: The graph of 2x + 3y > 1 is an open half plane.
  As 2(0) + 3 (0) > 1 is not true.
  So the region is not on the origin side.

• Ans 1:

State fundamental extreme point theorem.

• Ans 1: From all the points in a plane bounded by a number of lines the maximum or minimum value of the objective function occurs only at one of the vertices of the bounded linear region.

The region of graph 2x + y > 2 lies on the origin side or not.

• Ans 1: The graph of 2x + y > 2 is the open half plane.
  As 2(0) + 0 > 2 is not true.
  So the region is not on the origin side of 2x + y = 2.

Define a corner point.

• Ans 1: A point of a solution region where two of its boundary lines intersect is called a corner point or a vertex of the solution region.

• Ans 1:

• Ans 1:

• Ans 1:

• Ans 1:

• Ans 1:

Define non-negative constraints and decision variable.

• Ans 1: The variables used in the system of linear inequalities relating to the problems of everyday life non-negative are called non-negative constraints. The non-negative variables are called decision variables.

Define the solution region.

• Ans 1: The common region of all the graphs of each of inequality is the system on the same coordinate axes is called the solution region for the system of inequalities.

• Ans 1:

• Ans 1:

• Ans 1:

• Ans 1:

Define a feasible solution set.

• Ans 1: A set containing of all the feasible solution of the system of linear inequalities is called a feasible solution set.

What are constraints in linear programming ?

• Ans 1: The conditions in the form of linear equations and in-equations are known as constraints.

Define problem constraints.

• Ans 1: The system of linear inequalities involved in the problem concerned is called problem constraints.

• Ans 1:

• Ans 1:

• Ans 1:

Define an objective function.

• Ans 1: A function, which is to be maximized or minimized, is called an objective function.

Define feasible solution.

• Ans 1: The set of values of variables satisfying all the constraints lying in the first quadrant is known as feasible solution.