summaryrefslogtreecommitdiff
path: root/Master/texmf-dist/doc/latex/thuthesis/data/appendix-survey.tex
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2020-09-09 20:57:31 +0000
committerKarl Berry <karl@freefriends.org>2020-09-09 20:57:31 +0000
commit4a264bf091040319f9bc0a0564729de3a3bfdb11 (patch)
tree02bc05d3a123693f37f4ae758d7c16aa330edeef /Master/texmf-dist/doc/latex/thuthesis/data/appendix-survey.tex
parent736754172b88861049bf28a4e4b381af4f42a4af (diff)
thuthesis (9sep20)
git-svn-id: svn://tug.org/texlive/trunk@56305 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/doc/latex/thuthesis/data/appendix-survey.tex')
-rw-r--r--Master/texmf-dist/doc/latex/thuthesis/data/appendix-survey.tex4
1 files changed, 2 insertions, 2 deletions
diff --git a/Master/texmf-dist/doc/latex/thuthesis/data/appendix-survey.tex b/Master/texmf-dist/doc/latex/thuthesis/data/appendix-survey.tex
index a3c5ef6205a..5c09088a383 100644
--- a/Master/texmf-dist/doc/latex/thuthesis/data/appendix-survey.tex
+++ b/Master/texmf-dist/doc/latex/thuthesis/data/appendix-survey.tex
@@ -119,7 +119,7 @@ extreme point is the optimal solution.
\subsection{Nonlinear Programming}
-If at least one of the functions $f(x),g_j(x),j=1,2,\cdots,p$ is nonlinear, then
+If at least one of the functions $f(x),g_j(x),j=1,2,\dots,p$ is nonlinear, then
SOP is called a \emph{nonlinear programming}.
A large number of classical optimization methods have been developed to treat
@@ -167,7 +167,7 @@ the \emph{branch-and-bound enumeration} developed by Balas (1965) and Dakin
\hfill\textit{Uncertain Programming\/}\quad(\textsl{BaoDing Liu, 2006.2})
-\bibliographystyle{plainnat}
+\bibliographystyle{unsrtnat}
\bibliography{ref/refs,ref/appendix}
\end{survey}