z-logo
open-access-imgOpen Access
Getting optimal solution as nasty number using simplex method
Author(s) -
P. Sumathi,
N. Indhumathi
Publication year - 2020
Publication title -
aip conference proceedings
Language(s) - English
Resource type - Conference proceedings
SCImago Journal Rank - 0.177
H-Index - 75
eISSN - 1551-7616
pISSN - 0094-243X
DOI - 10.1063/5.0027377
Subject(s) - simplex algorithm , linear programming , simplex , revised simplex method , schedule , mathematical optimization , computer science , maximization , integer programming , interdependence , algorithm , mathematics , combinatorics , political science , law , operating system

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom