Iteration 1 - OR_EXPERT_REFINEMENT
Sequence: 3
Timestamp: 2025-07-25 22:28:18

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 university wants to maximize student participation in elections by allocating resources (e.g., campaign materials, reminders) to different majors based on historical voting patterns and student demographics.",
  "optimization_problem": "The goal is to maximize the total expected votes across all election positions by allocating resources to different majors. The decision variables represent the amount of resources allocated to each major. Constraints include budget limits, minimum resource allocations per major, and ensuring that resources are allocated based on the number of students in each major.",
  "objective": "maximize \u2211(expected_votes_per_major \u00d7 resource_allocation_per_major)",
  "table_count": 2,
  "key_changes": [
    "Schema changes include creating tables for expected votes, resource allocations, and budget constraints. Configuration logic updates include scalar parameters for budget and resource limits, and formulas for expected votes calculation."
  ],
  "math_consistency": "high",
  "next_iteration_focus": "Refine the constraints and objective function based on additional data requirements",
  "mapping_adequacy_summary": "needs_improvement"
}

CURRENT SCHEMA:
```sql
-- Iteration 1 Database Schema
-- Objective: Schema changes include creating tables for expected votes, resource allocations, and budget constraints. Configuration logic updates include scalar parameters for budget and resource limits, and formulas for expected votes calculation.

CREATE TABLE ExpectedVotesPerMajor (
  major STRING,
  expected_votes INTEGER
);

CREATE TABLE ResourceAllocationPerMajor (
  major STRING,
  resource_allocation INTEGER
);

CREATE TABLE Student (
  major STRING,
  number_of_students_in_major INTEGER
);


```

CURRENT DATA DICTIONARY:
{
  "tables": {
    "ExpectedVotesPerMajor": {
      "business_purpose": "Expected votes per major based on historical voting data",
      "optimization_role": "objective_coefficients",
      "columns": {
        "major": {
          "data_type": "STRING",
          "business_meaning": "Major name",
          "optimization_purpose": "Identifier for major",
          "sample_values": "Computer Science, Biology"
        },
        "expected_votes": {
          "data_type": "INTEGER",
          "business_meaning": "Expected number of votes",
          "optimization_purpose": "Coefficient in objective function",
          "sample_values": "100, 200"
        }
      }
    },
    "ResourceAllocationPerMajor": {
      "business_purpose": "Amount of resources allocated to each major",
      "optimization_role": "decision_variables",
      "columns": {
        "major": {
          "data_type": "STRING",
          "business_meaning": "Major name",
          "optimization_purpose": "Identifier for major",
          "sample_values": "Computer Science, Biology"
        },
        "resource_allocation": {
          "data_type": "INTEGER",
          "business_meaning": "Amount of resources allocated",
          "optimization_purpose": "Decision variable in optimization model",
          "sample_values": "500, 1000"
        }
      }
    },
    "Student": {
      "business_purpose": "Student demographics and major information",
      "optimization_role": "business_data",
      "columns": {
        "major": {
          "data_type": "STRING",
          "business_meaning": "Major name",
          "optimization_purpose": "Identifier for major",
          "sample_values": "Computer Science, Biology"
        },
        "number_of_students_in_major": {
          "data_type": "INTEGER",
          "business_meaning": "Number of students in each major",
          "optimization_purpose": "Constraint bound for resource allocation",
          "sample_values": "100, 200"
        }
      }
    }
  }
}


CURRENT BUSINESS CONFIGURATION LOGIC:
{
  "total_budget": {
    "sample_value": 100000,
    "data_type": "INTEGER",
    "business_meaning": "Total budget available for resource allocation",
    "optimization_role": "Constraint bound for total resource allocation",
    "configuration_type": "scalar_parameter"
  },
  "minimum_allocation_per_major": {
    "sample_value": 500,
    "data_type": "INTEGER",
    "business_meaning": "Minimum resource allocation required per major",
    "optimization_role": "Constraint bound for minimum resource allocation",
    "configuration_type": "scalar_parameter"
  },
  "maximum_allocation_per_major": {
    "sample_value": 5000,
    "data_type": "INTEGER",
    "business_meaning": "Maximum resource allocation allowed per major",
    "optimization_role": "Constraint bound for maximum resource allocation",
    "configuration_type": "scalar_parameter"
  },
  "resource_per_student": {
    "sample_value": 10,
    "data_type": "INTEGER",
    "business_meaning": "Resource allocation per student",
    "optimization_role": "Constraint bound for resource allocation per student",
    "configuration_type": "scalar_parameter"
  },
  "expected_votes_formula": {
    "formula_expression": "historical_votes * student_engagement_factor",
    "data_type": "STRING",
    "business_meaning": "Calculation of expected votes per major",
    "optimization_role": "Objective coefficient for expected votes",
    "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": "voter_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": "voter_2",
  "iteration": 1,
  "business_context": "A university aims to maximize student participation in elections by allocating resources (e.g., campaign materials, reminders) to different majors based on historical voting patterns and student demographics. The optimization model ensures resource allocation respects budget limits, minimum and maximum allocation per major, and proportional allocation based on student numbers.",
  "optimization_problem_description": "Maximize the total expected votes across all election positions by allocating resources to different majors. The decision variables represent the amount of resources allocated to each major. Constraints include budget limits, minimum and maximum resource allocations per major, and proportional allocation based on the number of students in each major.",
  "optimization_formulation": {
    "objective": "maximize \u2211(expected_votes_per_major \u00d7 resource_allocation_per_major)",
    "decision_variables": "resource_allocation_per_major: integer (amount of resources allocated to each major)",
    "constraints": [
      "\u2211(resource_allocation_per_major) \u2264 total_budget",
      "resource_allocation_per_major \u2265 minimum_allocation_per_major for all majors",
      "resource_allocation_per_major \u2264 maximum_allocation_per_major for all majors",
      "resource_allocation_per_major \u2264 resource_per_student \u00d7 number_of_students_in_major for all majors"
    ]
  },
  "current_optimization_to_schema_mapping": {
    "objective_coefficients": {
      "expected_votes_per_major[major]": {
        "currently_mapped_to": "ExpectedVotesPerMajor.expected_votes",
        "mapping_adequacy": "good",
        "description": "Expected number of votes per major, used as coefficients in the objective function"
      }
    },
    "constraint_bounds": {
      "total_budget": {
        "currently_mapped_to": "business_configuration_logic.total_budget",
        "mapping_adequacy": "good",
        "description": "Total budget available for resource allocation"
      },
      "minimum_allocation_per_major[major]": {
        "currently_mapped_to": "business_configuration_logic.minimum_allocation_per_major",
        "mapping_adequacy": "good",
        "description": "Minimum resource allocation required per major"
      },
      "maximum_allocation_per_major[major]": {
        "currently_mapped_to": "business_configuration_logic.maximum_allocation_per_major",
        "mapping_adequacy": "good",
        "description": "Maximum resource allocation allowed per major"
      },
      "resource_per_student[major]": {
        "currently_mapped_to": "business_configuration_logic.resource_per_student",
        "mapping_adequacy": "good",
        "description": "Resource allocation per student, used to calculate proportional allocation"
      },
      "number_of_students_in_major[major]": {
        "currently_mapped_to": "Student.number_of_students_in_major",
        "mapping_adequacy": "good",
        "description": "Number of students in each major, used to calculate proportional allocation"
      }
    },
    "decision_variables": {
      "resource_allocation_per_major[major]": {
        "currently_mapped_to": "ResourceAllocationPerMajor.resource_allocation",
        "mapping_adequacy": "good",
        "description": "Amount of resources allocated to each major",
        "variable_type": "integer"
      }
    }
  },
  "missing_optimization_requirements": [],
  "iteration_status": {
    "complete": true,
    "confidence": "high",
    "next_focus": "Ready for convergence"
  }
}
