## Problem Description and Formulation

The candy store has 30 kilograms of gummy bears and 25 kilograms of gummy worms. They sell two mixtures of these gummies: mixture A and mixture B. The compositions of the mixtures are as follows:
- Mixture A: 75% gummy bears and 25% gummy worms.
- Mixture B: 40% gummy bears and 60% gummy worms.

The profit from selling a kilogram of mixture A is $30, and from selling a kilogram of mixture B is $40.

## Decision Variables

Let \(x_A\) be the number of kilograms of mixture A to be made, and \(x_B\) be the number of kilograms of mixture B to be made.

## Objective Function

The objective is to maximize the total profit \(P\), given by:
\[P = 30x_A + 40x_B\]

## Constraints

1. **Gummy Bears Constraint**: The total amount of gummy bears used does not exceed 30 kilograms. Given that mixture A is 75% gummy bears and mixture B is 40% gummy bears:
\[0.75x_A + 0.40x_B \leq 30\]

2. **Gummy Worms Constraint**: The total amount of gummy worms used does not exceed 25 kilograms. Given that mixture A is 25% gummy worms and mixture B is 60% gummy worms:
\[0.25x_A + 0.60x_B \leq 25\]

3. **Non-Negativity Constraints**: The amounts of mixture A and mixture B to be made cannot be negative:
\[x_A \geq 0, x_B \geq 0\]

## Gurobi Code

```python
import gurobi

def solve_candy_store_problem():
    # Create a new model
    model = gurobi.Model()

    # Define the decision variables
    x_A = model.addVar(name="x_A", lb=0, ub=None, obj=30)  # Mixture A
    x_B = model.addVar(name="x_B", lb=0, ub=None, obj=40)  # Mixture B

    # Gummy bears constraint
    model.addConstr(0.75 * x_A + 0.40 * x_B <= 30, name="gummy_bears")

    # Gummy worms constraint
    model.addConstr(0.25 * x_A + 0.60 * x_B <= 25, name="gummy_worms")

    # Set the objective to maximize profit
    model.setObjective(30 * x_A + 40 * x_B, gurobi.GRB.MAXIMIZE)

    # Optimize the model
    model.optimize()

    # Check if the model is optimized
    if model.status == gurobi.GRB.OPTIMAL:
        print(f"Optimal solution found. Mixture A: {x_A.x}, Mixture B: {x_B.x}")
        print(f"Maximum profit: ${30 * x_A.x + 40 * x_B.x:.2f}")
    else:
        print("No optimal solution found.")

solve_candy_store_problem()
```