የ12ኛ ክፍል ውጤት ወጥቷል፤ ውጤትዎን የሚያዩበት መንገድ

የ12ኛ ክፍል ሒሳብ ምዕራፍ 4

Linear programming: test every corner

4 ደቂቃ · የተሠሩ 2 ያለፉ የፈተና ጥያቄዎች

የትምህርቱ ክፍሎች

ትምህርቱን ከዚያ ጀምሮ ለማጫወት አንድ ክፍል ይንኩ።

የ12ኛ ክፍል ሒሳብ ምዕራፍ 4 የ4 ደቂቃ የ Temari ቪዲዮ ትምህርት፦ Linear programming: test every corner። 2 ያለፉ የፈተና ጥያቄዎችን ደረጃ በደረጃ ይሠራል። ትምህርቱ የሚናገረው ሁሉ ከቪዲዮው በታች ተጽፏል። ትምህርቱ በእንግሊዝኛ ነው።

ስለ ምዕራፍ 4 ተጨማሪ

የምዕራፉ ገጽ Temari በዚህ ምዕራፍ ላይ ያለውን ሌላውን ይዟል፤ ለምሳሌ አጭር ማስታወሻዎችና የመልመጃ ጥያቄዎች ከመልሶቻቸው ጋር።

የምዕራፍ 4 ገጽ ይክፈቱ

ትምህርቱ የሚናገረው ሁሉ

የትምህርቱ ቃላት በየክፍሉ። ትምህርቱን ከዚያ ጀምሮ ለማጫወት ሰዓቱን ይንኩ።

0:00Introduction

A linear programming problem asks for the best value of something, the largest or the smallest, when a few rules limit your choices. The answer always sits at a corner. Today you learn to find the corners, and to test each one.

0:15The words you need

First, the words. The quantity you want to make largest or smallest is the objective function, Z equals a x plus b y. The limits are the constraints, written as linear inequalities. All the points that satisfy every constraint together make the feasible region. And a point where two boundary lines of the region meet is a corner point, also called a vertex.

Now the key fact from your textbook. If the feasible region is bounded, which means it can be closed in and does not run on forever, then Z has both a maximum and a minimum, and each one occurs at a corner point.

0:55Maximize $Z = 3x + 2y$

Let's try one. Maximize Z equals three x plus two y, with x plus two y at most four, x minus y at most one, and x and y not negative. Step one, draw the feasible region. Here it is, between the two axes and the two lines.

Step two, find the corners. Three are easy to read: zero zero, one zero, and zero two. The fourth is where the two lines cross. Solve them together, and you get two, one.

Step three, put each corner into Z. The origin gives zero. One zero gives three. Two one gives eight. Zero two gives four. Step four, pick the largest. The maximum is eight, at the point two, one.

1:49Exam question 1ያለፈ ፈተና

Now a real exam question, from the 2017 national exam. Maximize Z equals four x plus y, subject to x plus y at most fifty, three x plus y at most ninety, and x and y not negative. Pause the video, and try it.

When y is zero, the first rule lets x go up to fifty, but the second stops it at thirty. So one corner is thirty, zero. Another is zero, fifty. The last corner is where the lines cross. Subtract them: two x is forty, so x is twenty and y is thirty.

Now test. Thirty zero gives one hundred twenty. Twenty thirty gives one hundred ten. Zero fifty gives fifty. The largest is one hundred twenty. The answer is A. B, one hundred ten, is the trap. It comes from the crossing point, and the crossing is not always the best corner.

2:53Exam question 2ያለፈ ፈተና

One more, from the 2016 national exam. What is the maximum value of z equals two x plus three y, with x plus y at most six, two x minus y at most six, and x and y not negative? Pause, and try it.

The corners on the axes are three, zero and zero, six. The lines cross where x plus y is six and two x minus y is six. Add them: three x is twelve, so x is four and y is two. Test each corner. Three zero gives six. Four two gives fourteen. Zero six gives eighteen. The answer is D. A, fourteen, is the crossing point again. Test every corner, not just one.

3:47Summary

So remember. Draw the feasible region, and find every corner. Put each corner into the objective function. For a bounded region, the largest value is the maximum, and the smallest is the minimum. And never stop at the crossing point alone. Keep practising questions like these on Temari.et.

ይህን ምዕራፍ በመተግበሪያው ይለማመዱ

Temari ይህን ምዕራፍ ወደ ጊዜ የተቆረጠለት መልመጃ ይለውጠዋል፣ እየሠሩ ያርምዎታል፤ ያልገባዎትንም የሚያብራራ የ AI አስተማሪ አለ።

በነጻ ይጀምሩ

Temari.et ለ Android ስልኮች መተግበሪያ አለው፤ በ Google Play ላይ በነጻ ይገኛል።

ይግቡመለያዎን ይክፈቱ