Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » Math Topics » discretemath

Topic: Complexity of multi-minimizer minimization
Replies: 2   Last Post: Mar 19, 2011 10:41 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Yuly Shipilevsky

Posts: 17
Registered: 1/25/05
Re: RE: Complexity of multi-minimizer minimization
Posted: Mar 19, 2011 10:41 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

Thanks, Ben,

> By "minimizer" do you mean a function, as in l.p.?

No. I mean any point x0 from a feasible region F,
such point that:

f(x0) = min { f(x) } , for all x from some

feasible region F.



> Can we assume each iteration is over a bounded set,
> again similar to l.p.?


Yes.

>it seems we have n minimization problems, each with >respect to a different function f^i, where "^" >indicates a superscript.

We have one minimization of some function f(x),
subject to F, the problem that has several minimizing
points x1, ... , xn:

f(x1) = ... = f(xn) = min{ f(x) } , for all x
from some feasible region F.



Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.