To solve this optimization problem, we first need to translate the natural language description into a symbolic representation. Let's define the variables and the objective function as follows:

- `x1` represents the number of phones produced.
- `x2` represents the number of laptops produced.

The objective function aims to maximize profit. Given that each phone generates $300 in profit and each laptop generates $500, the objective function can be represented algebraically as:
\[ 300x_1 + 500x_2 \]

Now, let's translate the constraints:

1. **Silicon Chip Constraint**: Each phone requires 2 silicon chips, and each laptop requires 4 silicon chips. The company can buy up to 200 silicon chips per week.
   - Algebraic representation: \(2x_1 + 4x_2 \leq 200\)

2. **Engineering Time Constraint**: Each phone requires 5 hours of engineering time, and each laptop requires 6 hours. There are 250 hours available.
   - Algebraic representation: \(5x_1 + 6x_2 \leq 250\)

3. **Assembly Time Constraint**: Each phone requires 3 hours of assembly time, and each laptop requires 1 hour. There are 300 hours available.
   - Algebraic representation: \(3x_1 + x_2 \leq 300\)

4. **Minimum Production Constraints**:
   - For phones: \(x_1 \geq 30\)
   - For laptops: \(x_2 \geq 30\)

5. **Non-Negativity Constraints**: Since production quantities cannot be negative, we also have:
   - \(x_1 \geq 0\)
   - \(x_2 \geq 0\)

Given these definitions and constraints, the symbolic representation of our problem is:

```json
{
  'sym_variables': [('x1', 'number of phones'), ('x2', 'number of laptops')],
  'objective_function': '300*x1 + 500*x2',
  'constraints': [
    '2*x1 + 4*x2 <= 200',
    '5*x1 + 6*x2 <= 250',
    '3*x1 + x2 <= 300',
    'x1 >= 30',
    'x2 >= 30',
    'x1 >= 0',
    'x2 >= 0'
  ]
}
```

Now, let's implement this in Gurobi using Python:

```python
from gurobipy import *

# Create a new model
m = Model("Electronics_Production")

# Define variables
x1 = m.addVar(lb=30, vtype=GRB.INTEGER, name="phones")
x2 = m.addVar(lb=30, vtype=GRB.INTEGER, name="laptops")

# Set objective function
m.setObjective(300*x1 + 500*x2, GRB.MAXIMIZE)

# Add constraints
m.addConstr(2*x1 + 4*x2 <= 200, "silicon_chips")
m.addConstr(5*x1 + 6*x2 <= 250, "engineering_time")
m.addConstr(3*x1 + x2 <= 300, "assembly_time")

# Optimize model
m.optimize()

# Print solution
if m.status == GRB.OPTIMAL:
    print("Optimal solution found:")
    print(f"Phones: {x1.x}")
    print(f"Laptops: {x2.x}")
    print(f"Total Profit: {m.objVal}")
else:
    print("No optimal solution found.")
```