የ12ኛ ክፍል ሒሳብ ምዕራፍ 4
Sliding the objective line to the best corner
1:27
የ12ኛ ክፍል ሒሳብ ምዕራፍ 4 አጭር የ Temari የአኒሜሽን ማብራሪያ፦ Sliding the objective line to the best corner። የሚናገረው ሁሉ ከቪዲዮው በታች ተጽፏል። በነጻ ይታያል፤ መለያ አያስፈልግም። ማብራሪያዎቹ በእንግሊዝኛ ናቸው።
ማብራሪያው የሚናገረው ሁሉ
የማብራሪያው ቃላት በየክፍሉ፣ በቪዲዮው ላይ እንደሚጻፉት።
How large can Z = x + y get?
Linear programming finds the largest or smallest value of a quantity, like Z = x + y, under rules called constraints.
Each rule cuts away part of the plane
x and y cannot be negative: only this quarter of the plane is allowed.
The rule x + 2y ≤ 4 keeps one side of its line, the half-plane below. x − y ≤ 1 keeps the half-plane above its line.
What is left obeys every rule: the feasible region. Its corners are where boundary lines cross.
Slide the objective line
Write the objective as y = −x + Z: a line crossing the y axis at Z.
Raise Z, and the line slides up, staying parallel.
At Z = 3, it touches the region only at the corner (2, 1).
Any higher, and it misses the region completely.
The best point is a corner
So the largest value is Z = 3. The other corners give only 0, 1 and 2.
For a bounded region, closed in on every side, the largest and smallest Z always sit at corners.
Linear programming
Slide the objective line until it last touches the region: that point is a corner.
Save this one for your exam.
የምዕራፍ 4 ሙሉ ትምህርት
በዚህ ምዕራፍ ላይ ያለው ረዘም ያለ የ Temari ቪዲዮ ትምህርት ነው፤ የሚናገረው ሁሉ በገጹ ላይ ተጽፏል።
Linear programming: test every corner4 ደቂቃስለ ምዕራፍ 4 ተጨማሪ
የምዕራፉ ገጽ Temari በዚህ ምዕራፍ ላይ ያለውን ሌላውን ይዟል፤ ለምሳሌ አጭር ማስታወሻዎችና የመልመጃ ጥያቄዎች ከመልሶቻቸው ጋር።
የምዕራፍ 4 ገጽ ይክፈቱይህን ምዕራፍ በመተግበሪያው ይለማመዱ
Temari ይህን ምዕራፍ ወደ ጊዜ የተቆረጠለት መልመጃ ይለውጠዋል፣ እየሠሩ ያርምዎታል፤ ያልገባዎትንም የሚያብራራ የ AI አስተማሪ አለ።
በነጻ ይጀምሩTemari.et ለ Android ስልኮች መተግበሪያ አለው፤ በ Google Play ላይ በነጻ ይገኛል።

