Nonlinear Programming - Possible Solutions

Possible Solutions

  • feasible, that is, for an optimal solution subject to constraints, the objective function is either maximized or minimized.
  • unbounded, that it, for some subject to constraints, the objective function is either or .
  • infeasible, that is, there is no solution that is subject to constraints.

Read more about this topic:  Nonlinear Programming

Famous quotes containing the word solutions:

    “Science fiction writers foresee the inevitable, and although problems and catastrophes may be inevitable, solutions are not.”
    —Isaac Asimov (1920–1992)

    “The anorexic prefigures this culture in rather a poetic fashion by trying to keep it at bay. He refuses lack. He says: I lack nothing, therefore I shall not eat. With the overweight person, it is the opposite: he refuses fullness, repletion. He says, I lack everything, so I will eat anything at all. The anorexic staves off lack by emptiness, the overweight person staves off fullness by excess. Both are homeopathic final solutions, solutions by extermination.”
    —Jean Baudrillard (b. 1929)