Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities
From MaRDI portal
Publication:5558173
DOI10.1016/0041-5553(65)90045-5zbMath0171.35701OpenAlexW3022177319MaRDI QIDQ5558173
Publication date: 1967
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(65)90045-5
Related Items
Flux balance analysis: a geometric perspective, A LIBRARY FOR DOING POLYHEDRAL OPERATIONS, Computing Program Reliability Using Forward-Backward Precondition Analysis and Model Counting, Efficient constraint/generator removal from double description of polyhedra, The synthesis of Petri nets from path-automatic specifications, A general algorithm for determining all essential solutions and inequalities for any convex polyhedron, Efficient solution generation for multiple objective linear programming based on extreme ray generation method, Random problem genertion and the computation of efficient extreme points in multiple objective linear programming, Tissue Systems and Petri Net Synthesis, A common formula to compute the efficient sets of a class of multiple objective linear programming problems, Synthesis of Petri Nets with Whole-Place Operations and Localities, Complete linear descriptions of small asymmetric traveling salesman polytopes, How to find the convex hull of all integer points in a polyhedron?, A heuristic approach for the continuous error localization problem in data cleaning, Multiple objective linear programming models with interval coefficients -- an illustrated overview, Bi-objective optimization problems with two decision makers: refining Pareto-optimal front for equilibrium solution, Designing two factor experiments for selecting interactions, Typing Linear Constraints for Moding CLP( ${\cal R}$ ) Programs, Universal Lyapunov functions for non-linear reaction networks, Unrestricted variables in linear programming, PPLite: zero-overhead encoding of NNC polyhedra, Binary choice models with discrete regressors: identification and misspecification, Scenario Generation for Single-Period Portfolio Selection Problems with Tail Risk Measures: Coping with High Dimensions and Integer Variables, О безопасности схемы биометрической аутентификации, основанной на нейронной сети, Distributed Control of Discrete-Event Systems: A First Step, A new method for determining all maximal efficient faces in multiple objective linear programming, A complete description of cones and polytopes including hypervolumes of all facets of a polytope, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, On the Petri net realization of context-free graphs, Exact join detection for convex polyhedra and other numerical abstractions, Regions of Petri nets with a/sync connections, Which Symmetric Homogeneous Polynomials Can Be Proved Positive Semi-definite by Difference Substitution Method?, An extreme-point-ranking algorithm for the extreme-point mathematical programming problem, An algorithm for determining all extreme points of a convex polytope, Applying regions, Interpreting linear systems of equalities and inequalities. Application to the water supply problem, Cutting-plane theory: Algebraic methods, Eliminating extraneous edges in Greenberg's algorithm, Combinatorial optimization and small polytopes, Synthesis of Nets with Step Firing Policies, Automatic Editing for Business Surveys: An Assessment of Selected Algorithms, An algorithm for determining redundant inequalities and all solutions to convex polyhedra
