Online Short Questions Preparations

• Ans 1:

• Ans 1:

• Ans 1:

• Ans 1:

• Ans 1:

• Ans 1:

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 optimal solution

• Ans 1: The feasible solution, which maximizes or minimizes the objective function, is called the optimal solution.

• Ans 1:

What is a feasible solution of the system of linear inequalities ?

• Ans 1: Each point of the feasible region is called a feasible solution of the system of linear inequalitites.

• Ans 1:

What is a feasible solution of the system of linear inequalities ?

• Ans 1: Each point of the feasible region is called a feasible solution of the system of linear inequalitites.

What are constraints in linear programming ?

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

Define optimal solution

• Ans 1: The feasible solution, which maximizes or minimizes the objective function, is called the optimal solution.

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 an objective function.

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

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:

In how many ways the graph of linear equation of the form ax + by = c divides the plane.

• Ans 1: The graph of linear equation of the form ax + by = c is a straights line, which divides the plane into two disjoint regions, as ax + by < c and ax + by > c; where a, b and c are constants and a, b are not both zero.

• Ans 1:

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:

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 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.

• 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.

• Ans 1: