Online Linear Programming Solver

SSC Online Solver allows users to solve linear programming problems (LP or MILP) written in either Text or JSON format. By using our solver, you agree to the following terms and conditions. Input or write your problem in the designated box and press "Run" to calculate your solution!

Enter the Problem → (Run) →
→ View the Result
{}
Information to Include in the Result
Problem Input Format
Preloaded Examples
Type of Solution to Compute
Set Epsilon (Phase 1) ? What is Epsilon?

The epsilon value defines the tolerance threshold used to verify the feasibility of the solution at the end of Phase 1 of the Simplex algorithm. Smaller values ensure greater precision in checks but may exclude feasible solutions in problems formulated with large-scale numbers (billions or more). In such cases, it is advisable to increase the tolerance to detect these solutions.
/* The variables can have any name, but they must start with an alphabetic character and can be followed by alphanumeric characters. Variable names are not case-insensitive, me- aning that "x3" and "X3" represent the same variable.*/ min: 3Y +2x2 +4x3 +7x4 +8X5 5Y + 2x2 >= 9 -3X4 3Y + X2 + X3 +5X5 = 12 6Y + 3x2 + 4X3 <= 124 -5X4 y + 3x2 +6X5 <= 854 -3X4
/* This is a formulation of a linear programming problem in JSON format. */ { "objective": { "type": "min", "coefficients": { "Y": 3, "X2": 2, "X3": 4, "X4": 7, "X5": 8 } }, "constraints": [ { "coefficients": { "Y": 5, "X2": 2, "X4":-3 }, "relation": "ge", "rhs": 9, "name":"VINCOLO1" }, { "coefficients": { "Y": 3, "X2": 1, "X3": 1, "X5": 5 }, "relation": "eq", "rhs": 12, "name":"VINCOLO2" }, { "coefficients": { "Y": 6, "X2": 3, "X3": 4, "X4":-5 }, "relation": "le", "rhs": 124, "name":"VINCOLO3" } ], "bounds": { "Y": { "lower": -1, "upper": 4 }, "X2": { "lower": null, "upper": 5 } } }
min: 3Y +2x2 +4Z +7x4 +8X5 5Y +2x2 +3X4 >= 9 3Y + X2 + Z +5X5 = 12 6Y +3.0x2 +4Z +5X4 <= 124 Y +3x2 + 3X4 +6X5 <= 854 /* To make a variable free is necessary to set a lower bound to -∞ (both +∞ and -∞ are repre- sented with '.' in the text format) */ -1<= x2 <= 6 . <= z <= .
min: 3x1 +X2 +4x3 +7x4 +8X5 5x1 +2x2 +3X4 >= 9 3x1 + X2 +X3 +5X5 >= 12.5 6X1+3.0x2 +4X3 +5X4 <= 124 X1 + 3x2 +3X4 +6X5 <= 854 int x2, X3
min: 3x1 +X2 +4x3 +7x4 +8X5 constraint1: 5x1 +2x2 +3X4 >= 9 constraint2: 3x1 + X2 +X3 +5X5 >= 12.5 row3: 6X1+3.0x2 +4X3 +5X4 <= 124 row4: X1 + 3x2 +3X4 +6X5 <= 854 /*To declare all variables as integers, you can use the notation "int all", or use the notation that with the wildcard '*', which indicates that all variables that start with a certain prefix are integers.*/ int x*
min: 3x1 +X2 +4x3 +7x4 +8X5 5x1 +2x2 +3X4 >= 9 3x1 + X2 +X3 +5X5 >= 12.5 6X1+3.0x2 +4X3 +5X4 <= 124 X1 + 3x2 +3X4 +6X5 <= 854 1<= X2 <=3 /*A set of SOS1 variables limits the values of these so that only one variable can be non-zero, while all others must be zero.*/ sos1 x1,X3,x4,x5
/* The variables of LP problem are considered non- negative by default. The coefficients of the variables can be either or numbers or mathematical expressi- ons enclosed in square brackets '[]' */ /* Objective function: to maximize */ max: 3Y + 20.3Z /* Constraints of the problem */ 5.5Y + 2Z >= 9 3Y + Z + X3 + 3X4 + X5 >= [2^3.1] 6Y + 3.7Z + [10/3]X3 + 5X4 <= 124 /* pi=π */ [3*pi]Y + 3Z + 3X4 + 6X5 <= 54 /* It is possible to specify lower and upper boun- ds for variables using the syntax "l <= x <= u" or "x >= l", or "x <= u". If negative the variable can take values in the negative range. */ 1 <= Y <= 3 Z >= 6.4 /* Declaration of integer variables. */ int Z, Y /* Declaration of binary variables. */ bin X3, X4


Terms and Conditions of Use for the Online Solver

Welcome to the SSC Online Linear Programming Problem Solver. This service is powered by the SSC-LP library, distributed under the GNU General Public License, Version 3 (GPLv3). The SSC-LP library, which serves as the core engine of this service, is open-source software, and its source code is available at the following link: [GitHub]. Please note that the web interface and the online service are not covered by the GPLv3 license and are governed by the terms of use outlined on this page. The service was developed without external financial support and using limited hardware resources. To ensure fair and sustainable access for all users, certain operational restrictions have been implemented, particularly due to the limitations of the available hardware resources.

Usage Limitations

1) Each computation is limited to a maximum runtime of 10 seconds. Problems that exceed this limit will be terminated automatically.
2) Imported files containing LP problems must not exceed a maximum size of 10 MB. Larger files will not be accepted.
3) The service is provided "as is," without any explicit or implied warranty. Accuracy of the results is not guaranteed, and the service is not liable for any errors or damages resulting from its use.
4) The use of this service for illegal purposes or unauthorized automation is strictly prohibited.