# Archivo de Etiquetas (Tags) | basic feasible solution

## How to Solve a Linear Programming model with Dual Simplex Method

The Dual Simplex Method offers an alternative when solving Linear Programming (LP) models with algorithms. This method may be used in particular when the standard way to carry a linear programming model is not available from an initial basic feasible solution. Consider the following LP problem to illustrate the application of the Dual Simplex Method: […]

## Fundamental Theorem of Linear Programming and its Properties

In this following article we will address properties set by the Fundamental Theorem of Linear Programming through a conceptual discussion and practical and simple examples. These properties are essential when taking into consideration algorithmic resolutions of this kind of mathematical optimization models, among them is what we call the Simplex Method. Every Linear Programming (LP) […]

## How to detect that a Linear Programming problem is unbounded with the Simplex Method

The Simplex Method is an algorithm that allows us to solve Linear Programming models that sometimes helps us identify exceptional cases with infinite optimal solutions or that the problem is unbounded. In the implementation of the Simplex Method, an unbounded problem is encountered when in any iteration there are any non-basic variables with a negative reduced […]

## Changes in the Right Hand Side (RHS) of the Constraint (Sensitivity Analysis in Linear Programming)

Vector on Right Hand Side (RHS) associated with the constrains of a Linear Programming model may have different practical interpretations such as the availability of inputs for the manufacture of certain products, limiting of capacity, demand requirements, among other. As a result it is interesting to analyze the impact of the change of one or more […]

## What is a Basic Feasible Solution in Linear Programming

In Linear Programming (LP) a basic feasible solution is one that also belong to the feasible region or problem area can be represented by a feasible solution in implementing the Simplex Method satisfying nonnegative conditions. In this context, a basic solution corresponds to one of the vertices whose coordinate feasibility domain or solution can be represented by a set of […]