Linear Programming
CUET Mathematics Key cards: 5 of this chapter’s 26 are free to read, with no account.
Say the answer in your head, then turn the card over.
The 5 free cards from Linear Programming
Card 1 of 5
1 of 5
Definition
Define a linear programming problem.
Mathematics Part II, Ch 12, p. 396
Definition
Define a linear programming problem.
Thus, a Linear Programming Problem is one that is concerned with finding the optimal value (maximum or minimum value) of a linear function (called objective function) of several variables (say x and y), subject to the conditions that the variables are non-negative and satisfy a set of linear inequalities (called linear constraints).
Mathematics Part II, Ch 12, p. 396
Definition
What do the terms linear and programming mean in a linear programming problem?
Mathematics Part II, Ch 12, p. 396
Definition
What do the terms linear and programming mean in a linear programming problem?
The term linear implies that all the mathematical relations used in the problem are linear relations while the term programming refers to the method of determining a particular programme or plan of action.
Mathematics Part II, Ch 12, p. 396
Definition
What is a linear objective function in a linear programming problem?
Mathematics Part II, Ch 12, p. 396
Definition
What is a linear objective function in a linear programming problem?
Linear function Z=ax+by, where a, b are constants, which has to be maximised or minimized is called a linear objective function.
Mathematics Part II, Ch 12, p. 396
Definition
What are constraints in a linear programming problem?
Mathematics Part II, Ch 12, p. 396
Definition
What are constraints in a linear programming problem?
The linear inequalities or equations or restrictions on the variables of a linear programming problem are called constraints.
Mathematics Part II, Ch 12, p. 396
Definition
Define the term 'optimisation problem' (a problem on a linear function under linear inequality constraints).
Mathematics Part II, Ch 12, p. 396
Definition
Define the term 'optimisation problem' (a problem on a linear function under linear inequality constraints).
A problem which seeks to maximise or minimise a linear function (say of two variables x and y) subject to certain constraints as determined by a set of linear inequalities is called an optimisation problem.
Mathematics Part II, Ch 12, p. 396