サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
ノーベル賞
plato.asu.edu
Welcome! This site aims at helping you identify ready to use solutions for your optimization problem, or at least to find some way to build such a solution using work done by others. If you know of useful sources not listed here, please let us know. If something is found to be erroneous, please let us know, too. Where possible, public domain software is listed here. In any case, observe the expres
The Constrained NLO Problem The Problem: min f(x) subject to h(x)=0, g(x)>=0, n=dim(x), m=dim(g), p=dim(h). The picture shows feasible domain and level sets for f(x)=x1^2+x2^2, g(x)=(x1^2-x2,x2^2-x1) . Infeasible points are shown in dark brown and the levels of f are shown in the feasible domain. You'll find several sections: The LP-problem, also mixed integer and stochastic The QP-problem, also m
このページを最初にブックマークしてみませんか?
『plato.asu.edu』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く