Accès ouvert

A Hybrid Strategy for Reducing Feasible Convex Space and the Number of Variables for Solving a Conventional Large LP Model

Article scientifique 2017 Anglais

Résumé

This paper considers a conventional linear programming model of ‘n’ variables and ‘m’ constraints. In the proposed method, we deal with n_1 number of variables, where n_1≤n and use a strategic move to reduce the feasible convex search space before embarking on the simplex method. The feasible space reduction process can be repeated, if desired.

Citer ce document

Kumar, S., Munapo, E., Lesaoana, M., Nyamugure, P., Agarwal, N. (2017). A Hybrid Strategy for Reducing Feasible Convex Space and the Number of Variables for Solving a Conventional Large LP Model. https://doi.org/10.33889/ijmems.2017.2.4-017

Accès au document

Voir sur le dépôt source

Ce document est hébergé sur son dépôt institutionnel d'origine.

Auteur(s)

Santosh Kumar Elias Munapo Maseka Lesaoana Philimon Nyamugure Nidhi Agarwal

Statistiques

Consultations : 3

Téléchargements : 0