Showing 12 open source projects for "linear program solver"

View related business solutions
  • Earn up to 16% annual interest with Nexo. Icon
    Earn up to 16% annual interest with Nexo.

    Access competitive interest rates on your digital assets.

    Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
    Get started with Nexo.
  • Paessler - Monitor Your Whole Network in Minutes Icon
    Paessler - Monitor Your Whole Network in Minutes

    Auto-discovery finds your devices and deploys pre-configured sensors instantly. No project plan required, just visibility from day one.

    Waiting weeks for a monitoring rollout isn't an option when infrastructure doesn't stop running. PRTG's auto-discovery scans your network and suggests from over 200 pre-configured sensor types, so you're watching servers, applications and devices within minutes, not after a multi-week deployment. Enterprise-strength monitoring, without the enterprise complexity. Start your free trial today.
    Start Free 30-Day Trial
  • 1

    lpsolve

    Mixed Integer Linear Programming (MILP) solver.

    Mixed Integer Linear Programming (MILP) solver lp_solve solves pure linear, (mixed) integer/binary, semi-cont and special ordered sets (SOS) models.lp_solve is written in ANSI C and can be compiled on many different platforms like Linux and WINDOWS This project is moved to github: https://lp-solve.github.io/
    Leader badge
    Downloads: 2,005 This Week
    Last Update:
    See Project
  • 2

    Konbu Check

    Linear constraint feasibility check and get program.

    This program aims to check and gain a inner point from multiple set of linear constraints. This software works better in the case that range of variables are known and parameters are configured so. C++ and Eigen library needed, and to calculate more accurate, we may need mpfr++ library or, QD library. Freezed.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3
    Linear Program Solver (Simplex)
    Linear Program Solver (Solvexo) is an optimization package intended for solving linear programming problems. The main features of the Solvexo are: · Solvexo solver is based on the efficient implementation of the simplex method (one or two phases); · Solvexo provides not only an answer, but a detailed solution process as a sequence of simplex matrices, so you can use it in studying (teaching) linear programming
    Downloads: 5 This Week
    Last Update:
    See Project
  • 4
    Simple Simplex Solver is a tool function algorithms to solve equations in linear programming. its free to distribution, this tool may be useful for people. :-)
    Downloads: 1 This Week
    Last Update:
    See Project
  • Ship Agents Faster Icon
    Ship Agents Faster

    Transform your applications and workflows into powerful agentic systems at global scale.

    Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
    Start Free
  • 5

    ViennaCL

    Linear algebra and solver library using CUDA, OpenCL, and OpenMP

    ViennaCL provides high level C++ interfaces for linear algebra routines on CPUs and GPUs using CUDA, OpenCL, and OpenMP. The focus is on generic implementations of iterative solvers often used for large linear systems and simple integration into existing projects.
    Leader badge
    Downloads: 23 This Week
    Last Update:
    See Project
  • 6
    msp

    msp

    mathSuite Speed & Matrix Stream Processor

    ...You can perform also every Linear Algebra Operations included in mathSuite with new optimizations.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 7
    Linear Program Solver

    Linear Program Solver

    Solve linear programming problems

    Linear Program Solver (LiPS) is an optimization package oriented on solving linear, integer and goal programming problems. The main features of LiPS are: ● LiPS is based on the efficient implementation of the modified simplex method that solves large scale problems. ● LiPS provides not just an answer, but a detailed solution process as a sequence of simplex tables, so you can use it for studying/teaching linear programming
    Downloads: 18 This Week
    Last Update:
    See Project
  • 8
    JBernstein

    JBernstein

    JBernstein: Exploration techniques for non-linear constraint checking

    JBernstein is a tool implemented in Java that enables to check whether a polynomial constraint holds for all variables within their domain. It is mainly used in the verification or synthesis of cyber-physical systems where the system model is nonlinear. The tool also supports specifications in assume-guarantee style. The underlying algorithm is based on a translation to Bernstein polynomials, and several optimization techniques are implemented to ensure efficiency. Concerning performance,...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 9

    Dantzig-Wolfe Solver

    An implementation of Dantzig-Wolfe decomposition built upon GLPK

    An implementation of Dantzig-Wolfe decomposition built upon the GNU Linear Programming Kit. This is a command line tool for solving properly decomposed linear programs. There are several examples and some documentation to guide the use of this solver. Forked over to GitHub (see link).
    Downloads: 0 This Week
    Last Update:
    See Project
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New customers can spin up VMs, build with AI, and query data at no cost.

    Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
    Start Free
  • 10

    Zero Sum Game Solver Java Library

    Zero Sum Game Solver Java Library

    Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 11
    A simple program that solves linear equation systems. As of now only numerical coefficients are supported. The program is very simple and not suited for big matrices, since it uses laplace's method.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 12
    On open source MPI implementation of parallel bucket sorting. This implementation is scalable and gives linear speedup on SGI(Altix). The program sorts at using the bits and hence is stronger than other sorters which make assumptions about keys.
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next