Iteration 1 - OR_EXPERT_REFINEMENT
Sequence: 3
Timestamp: 2025-07-25 22:43:29

Prompt:
You are an Operations Research (OR) expert in iteration 1 of an alternating optimization process. The algorithm alternates between OR expert analysis and data engineering implementation until convergence.

CRITICAL MATHEMATICAL CONSTRAINTS FOR LINEAR/MIXED-INTEGER PROGRAMMING:
- The optimization problem MUST remain 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
- If previous iteration introduced nonlinear elements, redesign as linear formulation
- Maintain between 2 and 20 constraints for optimization feasibility

YOUR SCOPE: Focus exclusively on optimization modeling and mapping analysis. Do NOT propose database changes.
ROW COUNT AWARENESS: Understand that data engineer applies 3-row minimum rule - insufficient table data gets moved to business_configuration_logic.json.


DATA AVAILABILITY CHECK: 
Before listing missing requirements, verify:
- Check current schema for required data columns
- Check business configuration logic for required parameters  
- Only list as "missing" if data is truly unavailable
- If all mappings are "good", missing_requirements should be []

CONSISTENCY RULES:
- IF all mapping_adequacy == "good" THEN missing_optimization_requirements = []
- IF missing_optimization_requirements = [] THEN complete CAN be true
- IF complete == true THEN confidence should be "high"

SELF-CHECK: Before responding, verify:
1. Does current schema contain the data I claim is missing?
2. Are my mapping assessments consistent with missing requirements?
3. Is my complete status consistent with missing requirements?

MAPPING COMPLETENESS CHECK: Ensure logical consistency between:
- All objective coefficients mapped with adequacy evaluation
- All constraint bounds mapped with adequacy evaluation  
- All decision variables mapped with adequacy evaluation
- Missing requirements list matches inadequate mappings only


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



CURRENT STATE (iteration 0):
{
  "iteration": 1,
  "converged": false,
  "business_context": "A social network wants to maximize the number of friendships formed in the network while ensuring that each person has a balanced number of friends across different age groups.",
  "optimization_problem": "The objective is to maximize the total number of friendships formed, subject to constraints that ensure each person has a balanced number of friends across different age groups and that no person exceeds a maximum number of friendships.",
  "objective": "maximize \u2211(x_ij) where x_ij is a binary decision variable indicating whether person i is friends with person j",
  "table_count": 2,
  "key_changes": [
    "Schema changes include creating tables for decision variables, age groups, and friendships. Configuration logic updates include scalar parameters for max friendships per person and min friendships per age group, and a formula for friendship balance."
  ],
  "math_consistency": "high",
  "next_iteration_focus": "Define age groups and determine appropriate values for max_friendships_per_person and min_friendships_per_age_group",
  "mapping_adequacy_summary": "needs_improvement"
}

CURRENT SCHEMA:
```sql
-- Iteration 1 Database Schema
-- Objective: Schema changes include creating tables for decision variables, age groups, and friendships. Configuration logic updates include scalar parameters for max friendships per person and min friendships per age group, and a formula for friendship balance.

CREATE TABLE friendships (
  person_i INTEGER,
  person_j INTEGER,
  is_friends BOOLEAN
);

CREATE TABLE age_groups (
  age_group_id INTEGER,
  age_range STRING
);


```

CURRENT DATA DICTIONARY:
{
  "tables": {
    "friendships": {
      "business_purpose": "binary variable indicating whether person i is friends with person j",
      "optimization_role": "decision_variables",
      "columns": {
        "person_i": {
          "data_type": "INTEGER",
          "business_meaning": "ID of person i",
          "optimization_purpose": "index for decision variable",
          "sample_values": [
            1,
            2,
            3
          ]
        },
        "person_j": {
          "data_type": "INTEGER",
          "business_meaning": "ID of person j",
          "optimization_purpose": "index for decision variable",
          "sample_values": [
            2,
            3,
            4
          ]
        },
        "is_friends": {
          "data_type": "BOOLEAN",
          "business_meaning": "whether person i is friends with person j",
          "optimization_purpose": "binary decision variable",
          "sample_values": [
            true,
            false,
            true
          ]
        }
      }
    },
    "age_groups": {
      "business_purpose": "definitions of age groups for friendship balance constraints",
      "optimization_role": "business_data",
      "columns": {
        "age_group_id": {
          "data_type": "INTEGER",
          "business_meaning": "ID of age group",
          "optimization_purpose": "index for age group constraints",
          "sample_values": [
            1,
            2,
            3
          ]
        },
        "age_range": {
          "data_type": "STRING",
          "business_meaning": "age range for the group",
          "optimization_purpose": "defines age group for constraints",
          "sample_values": [
            "18-25",
            "26-35",
            "36-45"
          ]
        }
      }
    }
  }
}


CURRENT BUSINESS CONFIGURATION LOGIC:
{
  "max_friendships_per_person": {
    "sample_value": 10,
    "data_type": "INTEGER",
    "business_meaning": "maximum number of friendships allowed per person",
    "optimization_role": "constraint bound",
    "configuration_type": "scalar_parameter"
  },
  "min_friendships_per_age_group": {
    "sample_value": 2,
    "data_type": "INTEGER",
    "business_meaning": "minimum number of friendships required per age group",
    "optimization_role": "constraint bound",
    "configuration_type": "scalar_parameter"
  },
  "friendship_balance_formula": {
    "formula_expression": "sum(x_ij for j in age_group_k) >= min_friendships_per_age_group",
    "data_type": "STRING",
    "business_meaning": "ensures each person has a balanced number of friends across different age groups",
    "optimization_role": "constraint",
    "configuration_type": "business_logic_formula"
  }
}


TASK: Refine the optimization problem formulation by analyzing current data schema mapping and identifying requirements while maintaining LINEAR structure.

JSON STRUCTURE REQUIRED:

{
  "database_id": "network_2",
  "iteration": 1,
  "business_context": "Updated realistic business scenario description that supports linear optimization",
  "optimization_problem_description": "Refined description of LINEAR optimization problem", 
  "optimization_formulation": {
    "objective": "refined linear minimize/maximize with mathematical precision (sum of weighted variables only)",
    "decision_variables": "clearly defined controllable linear variables (continuous or integer)",
    "constraints": "mathematically precise LINEAR constraint definitions (no variable products or divisions) - maintain 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 still needed for linear formulation (should be [] if all mappings are good)"
  ],
  
  "iteration_status": {
    "complete": true/false based on linear formulation completeness,
    "confidence": "updated confidence level",
    "next_focus": "What needs refinement for linear optimization OR 'Ready for convergence'"
  }
}

Response:
{
  "database_id": "network_2",
  "iteration": 1,
  "business_context": "A social network aims to maximize the number of friendships formed while ensuring each person has a balanced number of friends across different age groups and does not exceed a maximum number of friendships.",
  "optimization_problem_description": "Maximize the total number of friendships formed, subject to constraints ensuring each person has a balanced number of friends across different age groups and does not exceed a maximum number of friendships.",
  "optimization_formulation": {
    "objective": "maximize \u2211(x_ij) where x_ij is a binary decision variable indicating whether person i is friends with person j",
    "decision_variables": "x_ij: binary variable indicating whether person i is friends with person j",
    "constraints": [
      "\u2211(x_ij for j in age_group_k) >= min_friendships_per_age_group for each person i and age group k",
      "\u2211(x_ij for all j) <= max_friendships_per_person for each person i",
      "x_ij = x_ji for all i, j to ensure mutual friendships"
    ]
  },
  "current_optimization_to_schema_mapping": {
    "objective_coefficients": {
      "1": {
        "currently_mapped_to": "friendships.is_friends",
        "mapping_adequacy": "good",
        "description": "coefficient for the objective function, representing the presence of a friendship"
      }
    },
    "constraint_bounds": {
      "max_friendships_per_person": {
        "currently_mapped_to": "business_configuration_logic.max_friendships_per_person",
        "mapping_adequacy": "good",
        "description": "maximum number of friendships allowed per person"
      },
      "min_friendships_per_age_group": {
        "currently_mapped_to": "business_configuration_logic.min_friendships_per_age_group",
        "mapping_adequacy": "good",
        "description": "minimum number of friendships required per age group"
      }
    },
    "decision_variables": {
      "x_ij": {
        "currently_mapped_to": "friendships.is_friends",
        "mapping_adequacy": "good",
        "description": "binary decision variable indicating whether person i is friends with person j",
        "variable_type": "binary"
      }
    }
  },
  "missing_optimization_requirements": [],
  "iteration_status": {
    "complete": true,
    "confidence": "high",
    "next_focus": "Ready for convergence"
  }
}
