Dataset Viewer
Auto-converted to Parquet Duplicate
instruction
stringlengths
1.03k
9.61k
input
stringclasses
1 value
output
stringlengths
544
10.1k
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> The problem is a linear programming (LP) problem. We need to decide the quantities of DrugA and DrugB (continuous variables) to maximize total efficacy, subject to a budget constraint, a minimum patient coverage constraint, and a storage capacity constraint. All parameters are given in the problem statement. </...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> **Modeling check** - Variables: continuous (per prompt: "nonnegative continuous numbers"). - Objective: maximize total MWh (linear). - Constraints: land (acres) and capital (thousands $) both ≤. - No ratio constraints. </think> <model> **Sets** None (individual variables) **Parameters** - Land available: 500 ...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Product-mix linear program. Variables: number of veggie wraps (veggie) and chicken wraps (chicken). Since wraps are indivisible units, variables should be integer. Objective: maximize total profit. Constraints: preparation time, cooking time, cooler capacity. All constraints are linear and direction is correct....
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Bottles are indivisible items, so standard and premium should be integer variables. The objective is to minimize total molding time: 4*standard + 6*premium. Constraints: resin capacity (2*standard + 5*premium <= 800), dye capacity (3*standard + 1*premium <= 600), and premium ratio (premium >= 0.4*(standard + pr...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think>The problem asks how many small and large carriers to use. Carriers are indivisible units, so the decision variables must be integer. Each small carrier holds 4 animals, each large carrier holds 10. There are at most 60 carriers total, the number of small carriers must be at least three times the number of large...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> We need to decide the number of standard containers (S) and refrigerated containers (R) to maximize total cargo weight. Each standard container carries 20 tons and uses 3 liters of fuel; each refrigerated container carries 40 tons and uses 2 liters of fuel. Total fuel available is 150 liters. At least 10 refrig...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: - Variables: P (primary hubs) and S (secondary hubs) are counts of hubs, indivisible, so INTEGER type. - Objective: minimize total transit time = 4*P + 6*S (hours per unit times number of hubs; note transit time per unit is given, total transit time is linear in P and S). - Constraints: (1) 50*P...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think>The problem involves maximizing monthly profit from processing plastic and glass waste. We have two resources: shredder and washer, each with a capacity of 2000 hours per month. Plastic requires 2 shredder hours and 1 washer hour per ton, while glass requires 1 shredder hour and 3 washer hours per ton. Profit pe...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> We need to decide how many standard and express packages to deliver to maximize total delivery value, subject to weight and volume capacities. This is an integer linear programming problem because packages are indivisible units. Decision variables are integer and nonnegative. The objective is linear, and both c...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think>The problem is to maximize total profit from producing standard and ergonomic chairs subject to cutting and assembly machine time limits. Since chairs are indivisible units, we define integer decision variables for the number of each chair type produced daily. The objective is to maximize 12 * x_standard + 18 * ...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> **Modeling check:** - Variables: chairs and tables are discrete items (counts), so integer type is appropriate. The prompt does not explicitly say continuous, so integer is correct. - Objective: minimize total cost, linear. - Constraints: wood and metal limits are ≤; table share limit is ≤ 40% of total producti...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> We need to determine the optimal generation levels (in MWh) for gas turbine, hydro, and solar generators to maximize total revenue, subject to a minimum total power demand of 600 MWh, a total fuel availability of 3000 units, and a requirement that at least 25% of total power comes from renewable sources (hydro ...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: This is a product mix problem with indivisible items (kits). Decision variables should be integer (counts). Objective is to maximize profit. Constraints: reagent A limit (2*rapid + 1*pcr ≤ 500), reagent B limit (1*rapid + 3*pcr ≤ 600), packaging limit (rapid ≤ 200). All constraints are linear. N...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> We need to decide how many liters of standard paint (standard) and premium paint (premium) to produce. The objective is to minimize total binder usage: 3*standard + 2*premium. Constraints: pigment limit (2*standard + 5*premium <= 4000), binder limit (3*standard + 2*premium <= 3000), at least 60% premium (premiu...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> The problem involves minimizing total storage cost for two types of medical kits (basic and advanced) subject to space capacity, labor hours, and minimum demand constraints. The decision variables are the quantities of basic and advanced kits to stock. Since kits are indivisible units, the variables should be i...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> The problem involves allocating capital across three asset classes (stocks, bonds, commodities) to maximize total expected profit, subject to a capital budget and a risk limit. The decision variables are the number of units invested in each asset class. Since units are indivisible, the variables should be integ...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: This is a cost-minimization linear program. Decision variables are the number of bags of each blend. Bags are indivisible, so variables should be integer (GRB.INTEGER). Objective: minimize total cost. Constraints: nitrogen and phosphorus minimum requirements (≥), potassium maximum limit (≤). All...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> **Modeling check** - Variables: matte, gloss (continuous, liters) – divisible quantity, no integer requirement in prompt. - Objective: minimize 4*matte + 6*gloss (solvent usage). - Constraints: pigment (2*matte+3*gloss ≤ 6000), binder (5*matte+4*gloss ≤ 8000), gloss share (gloss ≥ 0.4*(matte+gloss) → 0.6*gloss ...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> The problem involves deciding the number of organic waste digesters (D) and plastic-to-fuel converters (C) to maximize total daily waste processed. Each digester processes 40 tons and requires 2 operators; each converter processes 25 tons and requires 3 operators. The city has 2000 tons daily waste capacity and...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> We need to minimize total protein usage. Let regular_chews be the number of regular chews and premium_chews be the number of premium chews. The objective is 5*regular_chews + 7*premium_chews. Constraints: dental paste limit 8*regular_chews + 12*premium_chews <= 4800, at least 40% regular: regular_chews >= 0.4*(...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: This is a product-mix problem with indivisible units (cabinets). Decision variables are integer counts. Objective is linear cost minimization. Constraints are linear resource limits and a minimum production requirement. No ratio constraints. Gurobi 12.x API used correctly. </think> <model> **Se...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: hay bales and grain sacks are indivisible items (counts), so variables should be integer. Objective is to maximize total cost. Constraints: fiber requirement (≥600), protein requirement (≥320), storage limit (≤100). All constraints are linear. No ratio constraints. </think> <model> ### Sets None...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> The problem involves minimizing total labor used to produce steel beams and aluminum frames, subject to material and labor availability, a minimum production requirement for beams, and a ratio constraint between frames and beams. The decision variables are the number of beams and frames, which are discrete coun...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think>We need to decide how many Veggie Wraps and Chicken Wraps to produce to maximize profit, subject to limited resources (tortilla, vegetables, chicken, sauce). This is a linear programming problem. Since wraps are indivisible items, the decision variables should be integer. Modeling check: - Variable type: intege...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: - Variables: standard and deluxe chairs are integer (indivisible units). - Objective: minimize total labor hours (linear). - Constraints: wood limit, labor limit, deluxe ratio (linearized as deluxe >= 0.4*(standard+deluxe)). - Ratio constraint is linear after multiplying both sides. </think> <m...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> We need to decide how many brackets and flanges to produce. The objective is to minimize total material waste. The constraints are: steel and laser cutting capacity, at least 40% of total output must be flanges, and at least 50 brackets must be produced. This is a linear programming problem with two integer var...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: variables are integer (batches are indivisible). Objective minimizes total pigment units (8 per interior batch, 9 per exterior batch). Constraints: pigment availability (≤), interior ratio (≥30% of total), exterior ≥ 2× interior. Ratio constraint linearized as 0.7*interior - 0.3*exterior ≥ 0. </...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: decision variables are chair counts (indivisible) → integer type. Objective: minimize total cost (linear). Constraints: wood and labor are linear resource limits; deluxe ratio constraint is linearized as deluxe >= 0.4*(standard+deluxe) → 0.6*deluxe >= 0.4*standard. Gurobi 12.x API used correctly...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> The problem is a classic resource allocation linear program. We need to decide how many acres to plant with wheat and how many with barley to maximize total bushels, subject to land, fertilizer, and water constraints. The decision variables are continuous (acres). The objective is to maximize 12 * wheat_acres +...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: - Variables: S (standard chairs) and D (deluxe chairs) are counts of indivisible items, so they should be integer (GRB.INTEGER). - Objective: minimize total cost = 5*(2S+3D) + 20*(1S+2D). - Constraints: exact usage of wood (2S+3D=150) and labor (1S+2D=80). - No ratio or percentage constraints. <...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: Decision variables are counts of discrete items (steel beams, aluminum frames) so they must be integer. Objective is to minimize total production time (minutes). Constraints: steel, aluminum, labor limits (≤), minimum production requirements (≥). All constraints are linear. No ratio constraints....
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: decision variables are counts of vans (indivisible) so integer domain is appropriate. Objective is linear maximization of total packages. Constraints include availability, driver hours, total vans, minimum express, and ratio E ≤ 0.5*S (linear). All constraints are linear and suitable for Gurobi ...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think>Modeling check: variables are counts of nurses (indivisible) → INTEGER. Objective: maximize 8*day + 5*night (linear). Constraints: patient coverage (≥), total nurses (≤), day limit (≤), night ratio (≥ 0.4 of total). Ratio constraint linearized: night ≥ 0.4*(day+night) → 0.6*night ≥ 0.4*day → 3*night ≥ 2*day. All...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think>The problem asks for the number of units of each formulation to select. Units are indivisible counts, so the decision variables should be integer. The objective is to maximize total therapeutic efficacy, which is linear. The constraints are linear: an upper bound on active ingredient usage and lower bounds on ef...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> We need to minimize total raw material cost for producing chairs and tables. Chairs and tables are discrete items, so variables should be integer. Each chair uses 4 wood and 2 metal; each table uses 6 wood and 5 metal. Wood cost $2/unit, metal $3/unit. Available: 240 wood, 180 metal. At least 20 chairs and 10 t...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> We need to maximize profit from producing two types of vaccine batches subject to reagent limits and safety constraints. The decision variables are the number of Adenovirus batches (adenovirus) and Lentivirus batches (lentivirus). Since batches are indivisible, variables should be integer. The objective is to m...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: Batches are indivisible units, so variables should be integer (not continuous). Objective is to maximize total sanitizer volume. Constraints are linear resource limits and a ratio constraint on Premium batches. The ratio constraint x_prem ≤ 0.4*(x_std + x_prem) simplifies to 3*x_prem ≤ 2*x_std, ...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: variables A and B are continuous (batches can be fractional). Objective is maximize A+B (linear). Constraints: raw material 4A+6B≤2000, mixing time 2A+B≤600, ratio B≤0.6(A+B) linearized to B≤1.5A, minimum A≥30. All constraints linear, Gurobi 12.x compatible. </think> <model> **Sets** None (two ...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> We need to determine the optimal liters of matte and gloss paint to produce. The objective is to minimize total pigment usage (pigment A + pigment B). Matte uses 2 units of pigment A per liter, gloss uses 3 units of pigment B per liter. Constraints: pigment A availability (500 units), pigment B availability (60...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think>We need to maximize total patient coverage by deciding how many saline, electrolyte, and nutrient bags to produce, subject to ingredient availability and a requirement that electrolyte bags constitute at least 25% of total production. Bags are indivisible items, so integer variables are appropriate. The objectiv...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: decision variables are integer (count of chairs, indivisible). Objective minimizes linear cost. Constraints: wood and fabric are upper bounds, demand is lower bound, contract ratio is lower bound. Ratio constraint x_p >= 0.5 x_s is linear and valid. </think> <model> **Sets** None (single-period...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> This is a linear programming (LP) blending problem. Decision variables are liters of Solution A and Solution B, which are continuous (divisible). Objective is to maximize total nutrient units. Constraints: ingredient availability (upper bounds) and minimum nutrient requirements (lower bounds). All coefficients ...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> We need to maximize total power output from three generator types (gas, coal, hydro) subject to limits on fuel, cooling water, and heat emissions. The decision variables are the MWh produced by each generator. The objective coefficients are the power output values per MWh. The constraints are linear resource li...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: Decision variables x_A and x_B represent number of doses, which are indivisible counts. Therefore they should be integer (GRB.INTEGER). Objective is linear maximization. Constraints are linear. The ratio constraint x_B <= 0.4 (x_A + x_B) linearizes to 0.6 x_B - 0.4 x_A <= 0. All constraints are ...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: Decision variables are counts of parcels (indivisible units), so they must be integer. Objective is to maximize total profit. Key constraints: cargo space capacity (linear), express ratio (linearized to express_parcels >= 0.3 * total), budget (linear). All constraints are linear, suitable for LP...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> We need to maximize profit from producing pediatric and adult liquid medication formulations. The decision variables are liters of pediatric (P) and adult (A) formulations. The objective is to maximize 12P + 18A. Constraints: active ingredient limit (10P + 15A ≤ 5000), mixing tank capacity (P + A ≤ 400), minimu...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> The problem is a classic blending/linear programming problem. We need to decide the liters of SalineX and NutriY to minimize cost while meeting minimum requirements for sodium, potassium, and glucose. The data is given directly in the problem statement. Decision variables: - SalineX: liters of SalineX solution...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> **Modeling check** - Variables: gas_turbine, steam_turbine (continuous, nonnegative). Electricity output (MWh) is divisible, so continuous is correct. - Objective: minimize total fuel consumption (linear). - Constraints: demand (≥), fuel budget (≤), water budget (≤), minimum steam ratio (≥). The ratio constrain...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> The problem involves minimizing the total binder used in producing premium and standard paint, subject to minimum pigment and binder requirements and a ratio constraint on premium paint. The decision variables are continuous liters of each paint type. The objective is to minimize 2*premium + 3*standard. Constra...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> Modeling check: variables are counts of containers (indivisible) so integer domain is appropriate. Objective is maximize profit. Key constraints: weight capacity (≤), volume capacity (≤), minimum total containers (≥), minimum refrigerated containers (≥). No ratio constraints. Linear model, Gurobi 12.x compatibl...
SYSTEM: You are a helpful Assistant with expertise in operations research and the Gurobi solver. When the User provides an OR question, you will analyze it, build a detailed mathematical model, and provide Gurobi code compatible with the `gurobipy` package version 12.x installed in the current environment. Your respons...
<think> The problem is to minimize the total cost of purchasing Organic and Synthetic fertilizer bags while meeting minimum nutrient requirements and a ratio constraint. The decision variables are the number of bags of Organic (organic) and Synthetic (synthetic). Since bags are indivisible, both variables should be int...
End of preview. Expand in Data Studio

SLAI T-Rex OR SFT Dataset

The SLAI T-Rex OR SFT Dataset is a solver-oriented supervised fine-tuning corpus for Operations Research (OR) and mathematical programming. It was created with the self-distillation, contract-aware cleaning, review, and validation pipeline described in the SLAI T-Rex technical report.

Dataset Summary

Item Description
Domain Operations Research and mathematical programming
Release size 8,881 validated SFT records
Source pool 10,000 Clean-CoT candidates
Languages Primarily English
Problem representations DP, DT, and DPS
Solver ecosystem Gurobi-style Python modeling, primarily aligned with gurobipy 12.x
Common response forms Tagged reasoning/model/code, code-only answers, and LP-writing tasks

The report refers to the selected training configuration as the 10K Clean-CoT dataset. More precisely, 10,000 candidates entered the cleaning workflow, 9,174 passed reviewer filtering, and 8,881 passed the subsequent validation and export gates. This repository releases the final 8,881 validated records.

Dataset Construction

The data pipeline starts from high-quality optimization-modeling seeds and uses three intermediate representations:

  1. L1 Canonical IR normalizes the source, target contract, data interface, static code properties, and risk labels.
  2. L2 Semantic IR extracts objectives, sets, parameters, variables, constraints, and modeling risks.
  3. L3 Synthetic IR creates a new task abstraction with different domains, entities, numerical values, schemas, and modeling structures rather than copying the seed.

Each accepted task is rendered into one of three problem representations:

  • DP (Data in Problem): all data are written directly in the problem statement.
  • DT (Data in Table): data are represented in structured tables, usually Markdown tables.
  • DPS (Data-Problem Separate): the task uses a separate structured data interface, such as JSON or CSV.

Answer rendering follows the task contract. Tagged mathematical-modeling answers commonly contain <think>, <model>, and <python> blocks. Code-only feasibility tasks and LP-structure tasks retain stricter output formats.

Quality Control

The final release is produced through four quality gates:

  1. Cleaner: repairs concrete modeling, implementation, or output-contract errors.
  2. Reviewer: checks whether the repair is justified and blocks unsupported changes or over-repair.
  3. Local validation: checks code execution, Gurobi usage, output contracts, and LP-writing behavior where applicable.
  4. Export validation: verifies that only accepted, correctly formatted samples enter the release.

The Clean-CoT branch adds concise, task-relevant modeling checks for variable domains, objective direction, core constraints, nonlinear or ratio forms, and solver actions. It is intended to improve the correctness and learnability of the target response, not to maximize reasoning length.

The pipeline also applies text- and IR-level similarity controls to reduce direct reuse of benchmark wording, numerical values, objective semantics, constraint patterns, and parameter schemas. These controls reduce leakage risk but do not constitute a formal proof of decontamination.

Intended Use

The dataset is intended for:

  • supervised fine-tuning of mathematical-modeling and OR assistants;
  • research on domain-specific CPT/SFT transfer;
  • output-contract and solver-code alignment;
  • data-quality, structural-verification, and decontamination studies;
  • controlled evaluation of modeling and solver-facing behavior.

The dataset is not an evaluation benchmark. Users should keep evaluation instances and derived variants out of training splits and perform task-appropriate decontamination checks.

Citation

If you use this dataset, please cite the technical report:

@misc{li2026slaitrexfullparameterposttraining,
  title        = {SLAI T-Rex: Full-Parameter Post-training of the DeepSeek-V4 Family on Ascend SuperPOD},
  author       = {Dongfang Li and others},
  year         = {2026},
  eprint       = {2607.20145},
  archivePrefix= {arXiv},
  url          = {https://arxiv.org/abs/2607.20145}
}
Downloads last month
40

Paper for SLAI-AITP/SLAI-T-Rex-SFT