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:

    “Football strategy does not originate in a scrimmage: it is useless to expect solutions in a political compaign.”
    —Walter Lippmann (1889–1974)

    “Those great ideas which come to you in your sleep just before you awake in morning, those solutions to the world’s problems which, in the light of day, turn out to be duds of the puniest order, couldn’t they be put to some use, after all?”
    —Robert Benchley (1889–1945)