Iteration 0 - OR_EXPERT
Sequence: 1
Timestamp: 2025-07-25 22:27:59

Prompt:
You are an Operations Research (OR) expert focused ONLY on optimization modeling. Your role is to analyze the business domain and design LINEAR optimization problems without involving database design decisions.

CRITICAL MATHEMATICAL CONSTRAINTS FOR LINEAR/MIXED-INTEGER PROGRAMMING:
- The optimization problem MUST be either Linear Programming (LP) or Mixed-Integer Programming (MIP)
- Objective function MUST be linear: minimize/maximize ∑(coefficient × variable)
- All constraints MUST be linear: ∑(coefficient × variable) ≤/≥/= constant
- Decision variables can be continuous (LP) or mixed continuous/integer (MIP)
- NO variable products, divisions, or other nonlinear relationships
- Design business scenarios that naturally lead to linear mathematical formulations
- Generate between 2 and 20 constraints for optimization feasibility

YOUR SCOPE: Focus exclusively on optimization modeling and understanding current schema-to-optimization mapping. Do NOT propose database changes.
ROW COUNT AWARENESS: Be aware that data engineer will apply 3-row minimum rule - tables unable to generate sufficient meaningful rows will be moved to business_configuration_logic.json.

CRITICAL: Respond with ONLY a valid JSON object. No explanations, no markdown, no extra text.

Database: network_1

```sql
CREATE TABLE Highschooler (
  ID NUMBER,
  name TEXT,
  grade NUMBER
);
```

```sql
CREATE TABLE Friend (
  student_id NUMBER,
  friend_id NUMBER
);
```

```sql
CREATE TABLE Likes (
  student_id NUMBER,
  liked_id NUMBER
);
```



Current Business Configuration Logic: {} (initially empty)

TASK: Design a realistic LINEAR optimization problem and analyze how it maps to the current schema.

JSON STRUCTURE REQUIRED:

{
  "database_id": "network_1",
  "iteration": 0,
  "business_context": "Describe the realistic business scenario that leads to linear optimization (avoid scenarios requiring nonlinear relationships)",
  "optimization_problem_description": "Detailed description of what needs to be optimized using linear objective functions and constraints",
  "optimization_formulation": {
    "objective": "minimize/maximize specific_linear_metric with clear definition (sum of weighted variables only)",
    "decision_variables": "What linear variables can be controlled/decided (continuous or integer)",
    "constraints": "What linear limitations must be respected (no variable products or divisions) - design 2 to 20 constraints"
  },
  
  "current_optimization_to_schema_mapping": {
    "objective_coefficients": {
      "coefficient_name[indices]": {
        "currently_mapped_to": "table.column OR business_configuration_logic.key OR missing",
        "mapping_adequacy": "good/missing/redundant/partial/inaccurate",
        "description": "what this coefficient represents in the optimization model"
      }
    },
    "constraint_bounds": {
      "constraint_name[indices]": {
        "currently_mapped_to": "table.column OR business_configuration_logic.key OR missing", 
        "mapping_adequacy": "good/missing/redundant/partial/inaccurate",
        "description": "what this constraint bound represents"
      }
    },
    "decision_variables": {
      "variable_name[indices]": {
        "currently_mapped_to": "table.column OR business_configuration_logic.key OR missing",
        "mapping_adequacy": "good/missing/redundant/partial/inaccurate", 
        "description": "what this decision variable represents",
        "variable_type": "continuous/integer/binary"
      }
    }
  },
  
  "missing_optimization_requirements": [
    "List what data/parameters are needed for complete linear optimization model"
  ],
  
  "iteration_status": {
    "complete": false,
    "confidence": "low/medium/high",
    "next_focus": "What optimization aspects need refinement"
  }
}

Response:
{
  "database_id": "network_1",
  "iteration": 0,
  "business_context": "A high school wants to maximize the overall happiness of its students by strategically pairing them as friends, considering their existing friendships and likes. The goal is to ensure that students are paired with those they like, while also maintaining a balanced number of friends per student.",
  "optimization_problem_description": "The objective is to maximize the total happiness score, which is calculated based on the number of likes between paired friends. Constraints include ensuring each student has a minimum and maximum number of friends, and that friendships are mutual.",
  "optimization_formulation": {
    "objective": "maximize \u2211(happiness_score[student_id, friend_id] * x[student_id, friend_id]) where happiness_score is 1 if student_id likes friend_id, else 0",
    "decision_variables": "x[student_id, friend_id] (binary): 1 if student_id is paired with friend_id, else 0",
    "constraints": [
      "\u2211(x[student_id, friend_id]) \u2264 max_friends for each student_id",
      "\u2211(x[student_id, friend_id]) \u2265 min_friends for each student_id",
      "x[student_id, friend_id] = x[friend_id, student_id] for all student_id, friend_id",
      "x[student_id, student_id] = 0 for all student_id"
    ]
  },
  "current_optimization_to_schema_mapping": {
    "objective_coefficients": {
      "happiness_score[student_id, friend_id]": {
        "currently_mapped_to": "Likes.student_id AND Likes.liked_id",
        "mapping_adequacy": "partial",
        "description": "Represents whether student_id likes friend_id"
      }
    },
    "constraint_bounds": {
      "max_friends": {
        "currently_mapped_to": "missing",
        "mapping_adequacy": "missing",
        "description": "Maximum number of friends a student can have"
      },
      "min_friends": {
        "currently_mapped_to": "missing",
        "mapping_adequacy": "missing",
        "description": "Minimum number of friends a student must have"
      }
    },
    "decision_variables": {
      "x[student_id, friend_id]": {
        "currently_mapped_to": "Friend.student_id AND Friend.friend_id",
        "mapping_adequacy": "partial",
        "description": "Represents whether student_id is paired with friend_id",
        "variable_type": "binary"
      }
    }
  },
  "missing_optimization_requirements": [
    "max_friends parameter",
    "min_friends parameter",
    "happiness_score for all student_id, friend_id pairs"
  ],
  "iteration_status": {
    "complete": false,
    "confidence": "medium",
    "next_focus": "Define max_friends and min_friends parameters and complete happiness_score mapping"
  }
}
