mirror of
https://github.com/kuhyx/WUT_Computer_Science.git
synced 2026-11-10 22:47:09 +01:00
Krzysztof kuhy Rudnicki
ffa5dad02a
The 250-line cap applies to prose too, and the reports were the worst
offenders -- ENUME's projectA.tex alone was 1,876 lines. Each is now a
preamble plus one \input{} per section, which is how a long LaTeX document is
normally organised; not one byte of prose was rewritten.
"The PDF is unchanged" is checked by a script rather than by eye, because
hashing the PDF cannot work: pdflatex stamps a /CreationDate and an /ID into
every build, so two runs of the SAME source already differ. tex_fingerprint.sh
compares what a reader sees instead -- page count plus a hash of the extracted
text -- and it is stable across rebuilds of untouched sources, which is the
property that makes it usable as a gate.
It earned its keep immediately. Both ECOTE reports quote an example LaTeX
document inside an lstlisting block, so \end{document} appears in the middle
of the file; splitting on the FIRST one stranded everything after it. Same
page count, different text, caught automatically. EOPSY lab3 exposed a second
bug: a \section{} title that runs onto the next line.
Result: 19 .tex over the cap -> 1. The survivor,
ELAC/.../03-building-nfa-...tex, is 418 lines of consecutive tikz figures
with no subsection to split on and needs a hand-placed boundary.
Verified: 29 splits across two passes (section, then subsection for the
pieces still over), every one reporting `unchanged` from
scripts/tex_fingerprint.sh --check.
Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_0172dj34FDpao6wsix8ZuCzE
68 lines
2.5 KiB
TeX
68 lines
2.5 KiB
TeX
\section{Model Dwukryterialny}
|
|
\paragraph{Zbiory}
|
|
\begin{itemize}
|
|
\item $i, k \in F$ - Fabryki
|
|
\item $i, l \in M$ - Magazyny
|
|
\item $j \in K$ - Klienci
|
|
\end{itemize}
|
|
\paragraph{Parametery}
|
|
\begin{itemize}
|
|
\item $C_{i, j}$ - Koszty transportu dóbr z punktów $i$ (fabryka lub magazyn) do klienta $j$
|
|
\item $C_{k, l}$ - Koszty transportu dóbr z fabryki $i$ do magazynu $k$
|
|
\item $P_{i, j}$ - Binarnie określa czy preferencja klienta zostąła spełniona (1) czy nie (0)
|
|
\item $S_j$ - Poziom satysfakcji klienta $j$ - poziom satysfakcji liczymy w zależności od tego ile dany klient zamówił towaru \\
|
|
Zadowolenie klientów którzy zamawiają więcej towarów jest traktowane priorytetowo:
|
|
\[ S_1 = \frac{50}{60} \]
|
|
\[ S_2 = \frac{10}{60} \]
|
|
\[ S_3 = \frac{40}{60} \]
|
|
\[ S_4 = \frac{35}{60} \]
|
|
\[ S_5 = \frac{60}{60} \]
|
|
\[ S_6 = \frac{20}{60} \]
|
|
\item $D_j$ - Zapotrzebowanie klienta $j$
|
|
\end{itemize}
|
|
\paragraph{Zmienne decyzyjne}
|
|
\begin{itemize}
|
|
\item $x_{i,j}$ - Liczba dóbr (w tys. ton) przetransportowana z punktu $i$ (fabryka lub magazyn) do klienta $j$
|
|
\item $y_{k, l}$ - Liczba dóbr (w tys. ton) przetransportowana z fabryki $k$ do magazynu $l$
|
|
\end{itemize}
|
|
\paragraph{Funkcja celu}
|
|
\begin{enumerate}
|
|
\item Minimalizacja kosztów dystrybucji \\
|
|
\[ Min(\sum_{i, j} C_{i, j} * x_{i, j} + \sum{i, k} C_{i, k} * y_{i, k}) \]
|
|
\item Maksymalizacja satysfakcja klienta \\
|
|
W celu maksymalizacji satysfakcji klienta policzymy ile z dostaw do klientów odbyło się z preferencyjnych źródeł \\
|
|
\[ Max(\sum_{j} S_j * P_{i,j} * x_{i, j}) \]
|
|
\end{enumerate}
|
|
\paragraph{Funkcja celu alpha beta}
|
|
\[ \alpha * (Min(\sum_{i, j} C_{i, j} * x_{i, j} + \sum{i, k} C_{i, k} * y_{i, k})) + \beta * (Max(\sum_{j} S_j * P_{i,j} * x_{i, j})) \]
|
|
\paragraph{Ograniczenia}
|
|
Miesięczne możliwości produkcyjne fabryk
|
|
\begin{equation}
|
|
\sum_j x_{F1, j} + \sum_k y_{F1, k} \leq 150
|
|
\end{equation}
|
|
\begin{equation}
|
|
\sum_j x_{F2, j} + \sum_k y_{F2, k} \leq 200
|
|
\end{equation}
|
|
Miesięczna ilośc obsługiwanego towaru przez magazyny
|
|
\begin{equation}
|
|
\sum_j x_{M1, j} \leq 70
|
|
\end{equation}
|
|
\begin{equation}
|
|
\sum_j x_{M2, j} \leq 50
|
|
\end{equation}
|
|
\begin{equation}
|
|
\sum_j x_{M3, j} \leq 100
|
|
\end{equation}
|
|
\begin{equation}
|
|
\sum_j x_{M4, j} \leq 40
|
|
\end{equation}
|
|
Spełnienie preferencji klienta
|
|
\begin{equation}
|
|
\sum_i x_{i, j} = D_j
|
|
\end{equation}
|
|
Wartości niezerowe
|
|
\begin{equation}
|
|
x_{i, j}, y_{i, k} \geq 0
|
|
\end{equation}
|
|
|