4800 ounces of salt, 9600 ounces of flour, and 2000 ounces of herbs. A bag of mild herb chips needs 2 ounces of salt, 6 ounces of flour, and 1 ounce of herbs to produce. a bag of Spicy herb chips requires 3 ounces of salt, 8 ounces of flour, and 2 ounces of herbs. Profits for a bag of mild herb chips are $0.40 and for a bag of spicy herb chips $0.50. What is the constraint for salt

2A + 3B  ≤ 4800

Explanation:

Given:

Let A is mild herb chip

Let B is Spicy herb chip

So the total ounces of salt need to use for A and B is:

2A + 3B

and we only have 4800 ounces of salt, so the constraint for salt is:

2A + 3B  ≤ 4800

Explanation:

A constraint can be defined as a condition of an optimization problem that the solution must satisfy. Types of constraints include: primarily equality constraints, inequality constraints, and integer constraints.

For salt:

Given:

Total ounce = 4800 ounces

A bag of mild herb chips = 2 ounces of salt.

A bag of Spicy herb chips requires 3 ounces of salt.

Let a bag of spicy herb chips be denoted as x while a bag of mild herb chips be denoted as y.

Total ounce of salt = ounce of salt required in a bag of spicy herb chips + ounce of salt required in mild herb chips

Constraint of salt:

2y + 3x ≤ 4800 ounces of salt

none

explanation:

we're are the selections to pick from?

answer; functional fixedness;