SIH26119SoftwareSmart Automation
₹1,50,000 Prize (₹75k Joint)
•
Deadline: 20 September 2026
•
Submitted Ideas: 0/500

Indigenous GPU-Accelerated Optimization Solver (Sovereign Alternative to Express / CEPLEX)

Ministry / Organization: Mangalore Refinery and Petrochemicals Limited (MRPL)
Technical Complexity
10/10
Dataset Accessibility
9/10
36h Hackathon Viability
6/10
Step 0 • Zero-Jargon Layman Summary

“We are building a 'mathematical engine' that helps industries like oil refineries make the best possible decisions, such as how to blend chemicals or schedule production. Currently, India relies on expensive foreign software for this, so we are creating a homegrown, high-performance alternative that is faster, cheaper, and fully under our control.”

The DecodeX PS Decoder™

Deconstructed Problem Blueprint

Step 1

WHAT TO BUILD?

A high-performance mathematical optimization solver core (a computational engine) capable of solving complex Linear, Mixed-Integer, and Quadratic programming problems.

Step 2

WHO IS IT FOR?

Primary users are industrial engineers, data scientists, and operations researchers in sectors like MRPL, power grids, logistics, and manufacturing.

Step 3

WHY DOES IT EXIST?

India is currently dependent on expensive, proprietary foreign software (like CPLEX/Gurobi). This creates a 'black box' risk where we cannot modify the code for national strategic needs, and we face high recurring licensing costs.

Step 4

INPUT → PROCESS → OUTPUT ARCHITECTURE PIPELINE

01 • Inputs & Telemetry

Mathematical models in standard formats (MPS, LP files) representing industrial constraints and objective functions.

02 • Processing & AI Core

Implementation of Simplex/Interior-point methods, Branch-and-Cut algorithms, sparse matrix factorization, and GPU-accelerated parallel processing.

03 • Actionable Deliverables

Optimal variable values (the solution), objective function value, and solver status (optimal, infeasible, or unbounded).

Step 5

CONSTRAINTS

  • Must be built from scratch (no wrapping existing open-source solvers like CBC).
  • Must handle large-scale, sparse, and ill-conditioned industrial matrices.
  • Must demonstrate numerical stability and convergence on standard benchmarks (MIPLIB).
  • Must support multi-core and GPU acceleration.
Step 6

JURY METRICS

  • Computational time (latency) compared to commercial solvers.
  • Solution quality (optimality gap) on standard benchmarks.
  • Numerical stability on ill-conditioned matrices.
  • Memory efficiency for large-scale datasets.
Step 7

CORE BOTTLENECK

Numerical stability. Floating-point errors in large-scale matrix inversions and the 'curse of dimensionality' in branch-and-bound trees will cause most teams' solvers to crash or fail to converge on real-world industrial problems.

Why You Should Choose This PS (Pros)

  • High strategic national importance (Sovereignty).
  • Clear, objective performance metrics (benchmarks).
  • Massive potential for industry adoption if successful.
  • Strong 'wow' factor for judges due to the depth of mathematical engineering required.

Challenges & Risks to Watch (Cons)

  • Extremely high barrier to entry regarding mathematical knowledge.
  • Debugging optimization algorithms is notoriously difficult.
  • Performance optimization requires deep knowledge of hardware architecture (CPU/GPU cache lines).
Hackathon Blueprint

Recommended Tech Stack & Grand Finale Features

Frontend & Mobile
Not required (CLI focus)
Backend & APIs
C++ (for performance)Python (for prototyping/API wrapper)CUDA (for GPU kernels)
AI / ML & Models
Custom heuristics using lightweight ML models for variable selection
Database & Cloud
Standard file-based storage for benchmark datasets

Killer Features to Impress the SIH Jury

Custom GPU-accelerated sparse matrix-vector multiplication kernels.
Adaptive branching heuristics that learn from the problem structure.
Detailed 'Solver Log' that provides transparency into why a solution was chosen.
Seamless integration with Python via a C++ extension for ease of use.
View Official SIH 2026 Portal Raw Text
▼
•Background Almost every optimization problem in India's refining, petrochemical, power, logistics, manufacturing and planning sectors ultimately depends on a handful of foreign mathematical optimization solvers such as IBM ILOG CPLEX, Gurobi and FICO Xpress. These engines sit behind refinery scheduling, production planning, supply chain optimization, blending, energy management and many AI-driven decision-support systems. While they are extremely capable, they come with high recurring license costs, restrictive licensing models and limited visibility into the underlying optimization algorithms. Indian developers can formulate optimization problems, but they cannot inspect, modify or tailor the solver internals to suit strategic national requirements. Open-source alternatives such as COIN-OR CBC, HiGHS, GLPK and SCIP exist and have made significant progress, but they still lag behind commercial solvers for several classes of large-scale mixed-integer optimization problems and have not been developed, validated or optimized specifically for Indian industrial use cases. The real challenge is not building the modeling interface; it is developing a numerically robust optimization engine that consistently finds high-quality solutions for large, sparse and highly constrained industrial problems within practical computation times.
•Description The objective is to develop a sovereign mathematical optimization solver core rather than a complete modeling environment. The solver should support Linear Programming (LP), Mixed-Integer Linear Programming (MILP) and Quadratic Programming (QP) as the initial focus, with a modular architecture that can later be extended to Mixed-Integer Quadratic Programming (MIQP), Nonlinear Programming (NLP) and Mixed-Integer Nonlinear Programming (MINLP). Core algorithms may include revised simplex and interior-point methods for continuous optimization, together with branch-and-bound, branch-and-cut, cutting planes, presolve, heuristics and advanced node selection strategies for mixed-integer problems. The solver should exploit sparse matrix techniques, efficient numerical linear algebra and multi-core parallelization, with GPU acceleration considered where it provides measurable benefits. The emphasis is on numerical stability, scalability and reliable convergence across large industrial optimization problems rather than on graphical interfaces or modelling tools. It shall not be built upon any existing open source solver library but shall be built from scratch from mathematical foundation.

The scope is to solve optimization problems arising from refinery scheduling, crude blending, process optimization, production planning, logistics, power system dispatch, transportation and supply chain management. The benchmark is that the solver should consistently deliver optimal or near-optimal solutions for industrial-scale problems involving thousands to millions of variables and constraints, including highly degenerate models, ill-conditioned matrices and difficult mixed-integer formulations where weaker implementations exhibit excessive computation times or fail to converge.

•Expected Solution A robust optimization engine with a basic application programming interface (API) or command-line interface is sufficient; a polished graphical user interface is not required. The solver should successfully solve standard benchmark problems from recognised optimization libraries such as MIPLIB, Netlib or Mittelmann benchmark sets, with solution quality and computational performance compared against at least one established commercial or open-source solver. A clear demonstration of numerical robustness should be provided by solving challenging large-scale optimization problems involving degeneracy, weak LP relaxations or ill-conditioned constraint matrices, where simpler implementations struggle to achieve reliable convergence or acceptable solution times. The resulting solver should provide a transparent, extensible and sovereign foundation for future Indian optimization software across industrial, scientific and strategic applications.