Casio fx9750GII Getting Started page 62

MISCELLANEOUS FUNCTIONS
Linear programming with vertical lines: converting x = c to y = mx + c [in GRAPH] cont.
Example 2a
Problem:
Answer:
Then enter in the constraints and then draw them
F3 F6 F4
1 5 -
EXE 1
X, θ ,T
0 EXE 2
Note: You cannot see the line y = 1000x – 2000.
Find the intersection points
(vertices) of the lines that intersect
F5
for G-Solve then
SHIFT
F5
for [ISCT] (intersection)
then select two lines at a time and
generate the 5 intersection points.
Using the original equations:
y 15 – x y
Note:
You can see the line x = 2 but G-Solve is not available for the vertical line x = 2.
Some interpretation is required if the substitution line for x = c is not 'extremely'
vertical on the region the constraints are drawn.
Factorials, Combinations and Permutations – Calculations [in RUN-MAT]
Combinations and Permutations – x!,
KEY
Find the feasible region that satisfies the following
constraints over the domain 0
x + y 15 y 6 4x + y
Rearranging to make y the 'subject' gives:
y 15 – x y 6 y 24 - 4x
Becomes y
The V-Window
[SHIFT] [F3]
becomes:
Change Y= to Y
EXE 6 EXE
X, θ ,T
0 0 0
X, θ ,T
EXE F6
then
X, θ ,T
Y1 & Y4 gives (2 , 13)
Y2 and Y5 gives (3 , 6)
6 y 24 - 4x x 2 y
C and P respectively
n n
r r
RESULT
x 25 and range 0 y
24 x 2 y 2x
x 2 y 2x
1000x - 2000
2 4 - 4
- 2 0 0
to draw
Y1 and Y3 gives (3 , 12)
Y3 and Y5 gives (4 , 8)
2x gives:
Result
25:
Y2 and Y4 gives (2 , 6)
cont. on next page