Answer:
$196
Step-by-step explanation:
Lets assume,
cost of a belt = 'x'
cost of a pair of pants = 'y'
Now, According to the question;
- x + y = 490;
- cost of a bag = twice the cost of belt = 2x;
- cost of a pair of pants = twice the cost of bag
⇒ y = 2×2x ⇔ 4x
hence, by subtituting the values in equation' we get;
⇒ x + 4x = 490
⇒ 5x = 490
⇒ x = 98
So, the difference between the cost of the pair of pants and the bag ;
⇒ y - 2x
⇒ 4x - 2x
⇒ 2x = 2×98 = 196.
Answer:
Cody can play maximum number of 12 games.
Answer:
d. An optimal solution to linear programming problem can be found at an extreme point of the feasible region for the problem.
Step-by-step explanation:
A feasible solution satisfies all the constraints of the problem in linear programming. The constraints are the restrictions on decision variable. They limit the value of decision variable in linear programming. Optimal solutions occur when there is feasible problem in the programming.
Number 2 is 7 9/8 but its an improper fraction so you'll have to reduce that since im having trouble doing that.
Number 5 is 9 11/12
Hope this helps!