FACTOID # 150: The average person in the United Kingdom drinks as much tea as 23 Italians.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

FACTS & STATISTICS    Simple view

  1. Select countries to view: (hold down Control key and click to select several)

     

     

    Compare:

     

     

  1. Select fact or statistic: (* = graphable)

     

     

     

  2. (OPTIONAL) Compare to statistic: (both need to be graphable)

     

     

     

  3. View result as:

     

       
(OR) SEARCH ALL encyclopedia, stats & forums:   

Encyclopedia > Constraint (mathematics)

Constraint is an equation that defines a restriction of solutions of an optimization problem to a so called feasible set.


We distinguish between equality and inequality constraints.

[edit]

Example

A simple optimization problem can be defined as


subject to

and

x2 = 1-.


where x = (x1, x2) . In this example, the first line defines the function to be minimized (sometimes called the objective or cost function). The second and third lines defines two constraints, the first of which is inequality constraint and the second is equality constraint. These two constraints define the feasible set of points in which we search for the solution.


Without the constraints, the solution would be (0,0) where f(x) has the lowest value. But this solution does not satisfy the constraints (it is not included in the feasible set). The solution of the constraint optimization problem defined above is x=(1,1), which is the point with the lowest value of f(x) among all feasible points.


In standard form we write constraints in such a way that there is 0 on one side of equation or inequality. What is on the other side is called a constraint function. In the above example, constraints can be rewritten as


and

Different authors use different agreement with regard to the sign in inequality constraints, i.e. some authors would define the first constraint function with the opposite sign such that

[edit]

See also

[edit]

In mathematics, the term optimization refers to the study of problems that have the form Given: a function f : A R from some set A to the real numbers Sought: an element x0 in A such that f(x0) ≤ f(x) for all x in A (minimization) or such that... In mathematics, nonlinear programming (NLP) is the process of solving a system of equalities and inequalities over a set of unknown real variables, along with an objective function to be maximized or minimized. ... In mathematics, the Karush-Kuhn-Tucker conditions (also known as the Kuhn-Tucker or the KKT conditions) are necessary for a solution in nonlinear programming to be optimal. ...

External links

  • Nonlinear programming FAQ
  • Mathematical Programming Glossary
Major fields of mathematics
Algebra | Abstract algebra | Linear algebra | Analysis | Functional analysis | Numerical analysis | Calculus | Differential equations | Category theory | Combinatorics | Geometry | Algebraic geometry | Logic | Number theory | Set theory | Optimization | Probability | Statistics | Topology | Algebraic topology | Trigonometry


 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments
Please enter the 5-letter protection code

Want to know more?
Search encyclopedia, statistics and forums:

 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms.