Complete, runnable examples demonstrating Dantzig's capabilities across various optimization problem types.

All examples can be run directly:

# Run a specific example
mix run docs/user/examples/knapsack_problem.exs

# Or from the project root
elixir docs/user/examples/knapsack_problem.exs

Comprehensive Tutorial - Learn Dantzig through practical examples:

• Tutorial Examples - Complete tutorial covering all DSL features

Fundamental Optimization Problems:

• Knapsack Problem - Binary selection with weight constraints
• Assignment Problem - Optimal matching/assignment
• Transportation Problem - Network flow with supply/demand
• Diet Problem - Linear programming with nutritional constraints
• N-Queens Problem - Constraint satisfaction with pattern-based modeling

Manufacturing and Operations Management:

• Production Planning - Multi-period production with inventory
• Blending Problem - Optimal blending/mixing
• Resource Allocation - Resource assignment optimization
• Facility Location - Optimal facility placement

Time-based Optimization:

• School Timetabling - Complex multi-dimensional scheduling
• Minimax Scheduling - Fairness in scheduling

Network Optimization:

• Network Flow - Flow optimization through networks
• Supply Chain Network Design - Supply chain optimization

Demonstrating Advanced DSL Features:

• Pattern-Based Operations - Wildcard patterns and aggregations
• Variadic Operations - Variadic max/min/and/or functions
• New DSL Example - Modern DSL syntax demonstration
• Integer Programming - Integer variable optimization
• Multi-Objective LP - Multiple objective optimization

Classic Academic Problems:

• Two Variable LP - Simple two-variable linear program
• LP 1986 UG Exam - University exam problem
• LP 1987 UG Exam - University exam problem
• LP 1988 UG Exam - University exam problem
• LP 1992 UG Exam - University exam problem
• LP 1994 UG Exam - University exam problem
• LP 1995 UG Exam - University exam problem
• LP 1997 UG Exam - University exam problem

Financial Optimization:

• Portfolio Optimization - Investment portfolio selection
• Project Selection - Project investment decisions

Development and Testing Examples:

• Simple Working Example - Basic working example
• Working Example - Another basic example
• Test Basic DSL - DSL syntax testing
• Generate Timetable SVG - Visualization example

Good starting points for learning Dantzig:

• Two Variable LP
• Simple Working Example
• Working Example
• Knapsack Problem
• Assignment Problem

More complex problems with multiple constraints:

• Transportation Problem
• Production Planning
• Blending Problem
• Diet Problem
• Resource Allocation

Multi-dimensional problems with advanced features:

• N-Queens Problem
• School Timetabling
• Network Flow
• Supply Chain Network Design
• Pattern-Based Operations

Examples using model_parameters:

• Knapsack Problem
• Diet Problem
• Production Planning
• School Timetabling

Examples with generators and wildcards:

• N-Queens Problem
• Transportation Problem
• Pattern-Based Operations

Examples using abs, max, min, and logical operations:

• Variadic Operations
• Pattern-Based Operations

Examples with integer variables:

• Integer Programming
• Production Planning

• Quick Start Guide - Getting started with Dantzig
• Tutorial - Comprehensive tutorial
• DSL Syntax Reference - Complete syntax guide
• Modeling Guide - Best practices