Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 7 - Algebra: Graphs, Functions, and Linear Systems - 7.5 Linear Programming - Exercise Set 7.5 - Page 462: 21

Answer

Constraints are the restrictions in the linear programming problem and is represented as linear inequality.

Work Step by Step

Constraints in the linear programming problem. Sometimes, it is necessary to maximize or minimize the quantities involved in many problems to get the solution or to get the clarity of facts for taking decision. For this, use of linear algebraic expressions are highly useful. Objective function in the form of an algebraic linear expression is described in one or more variables that must be maximized or minimized according to the constraints given and need of the solution. Method used to do this is called linear programming method. For example, suppose every affected survivor of flood hit area should get water, food and medical kit. And the plane that is supposed to supply all these items is subject to weight and volume restrictions of these items. These restrictions are called constraints in linear programming problems. The list of such constraints forms the system of linear inequalities. If z is a weight that should not exceed to a limit for variable items x and y then constraint is expressed as: \[z\le x+y\]
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.