Virtual Simplex Method Pivot-In-Place Linear Programming

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current methods for solving linear programming problems on computers are prone to errors due to numerical inaccuracies and fail to handle changing constraints effectively, leading to incorrect or infeasible solutions.

Innovation Solution

The Virtual Simplex Method (VSM) embeds the original linear programming problem within a virtual problem, using virtual variables and pivot-in-place operations to minimize computational errors and maintain feasibility, allowing for dynamic adjustments without reinitialization.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If traditional simplex method is used to solve linear programming problems on computers, then computational speed is improved, but numerical inaccuracies and computer errors cause incorrect or infeasible solutions

Engineering Contradiction:
Improvecomputational speedVSAvoidsolution accuracy
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The patent introduces an intermediary representation called the E matrix that acts as a mediator between the original linear programming problem and the computational process. This E matrix stores the problem data in a format that allows exact arithmetic operations, preventing the accumulation of numerical errors while maintaining computational efficiency. The intermediary structure enables the system to achieve both speed and accuracy by decoupling the computational process from direct numerical manipulation.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent creates a virtual copy of the linear programming problem through the E matrix representation. Instead of directly manipulating the original problem data which is susceptible to numerical errors, the system works with this virtual copy that preserves the exact structure and relationships of the original problem. This copying approach allows the computational process to proceed without introducing numerical inaccuracies.

Inventive Principle:
Principle #26Copying

2Ease of manufacture

If traditional methods are used, then initial setup is simplified, but the system cannot handle changing constraints effectively and requires reinitialization

Engineering Contradiction:
Improveinitial setup simplicityVSAvoidhandling changing constraints
Core Design Contradiction:
Ease of manufactureVSAdaptability or versatility

Solution Approach 1:

The patent implements a dynamic system where the E matrix can be updated incrementally as constraints change. Instead of requiring complete reinitialization when constraints are modified, the system dynamically adjusts the E matrix representation and continues the optimization process. This dynamic approach maintains adaptability while preserving the simplicity of the initial setup, as the same data structure handles both static and dynamic scenarios.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The E matrix representation serves multiple functions: it stores the initial problem data, enables the optimization process, and facilitates handling of changing constraints. This universal data structure eliminates the need for separate handling mechanisms for different scenarios, allowing the system to maintain ease of setup while gaining adaptability to dynamic changes.

Inventive Principle:
Principle #6Universality (Multi-functionality)

3Device complexity

If conventional computational approaches are used, then implementation is straightforward, but accumulated computer errors lead to incorrect solutions

Engineering Contradiction:
Improveimplementation complexityVSAvoidsolution correctness
Core Design Contradiction:
Device complexityVSReliability

Solution Approach 1:

The E matrix serves as an intermediary that prevents direct numerical manipulation and the associated error accumulation. By introducing this intermediate representation layer, the system maintains straightforward implementation while eliminating the harmful effect of accumulated computer errors. The intermediary structure allows exact arithmetic to be performed on the problem data without introducing numerical inaccuracies.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent converts the potential harm of direct numerical computation into a benefit by using the E matrix representation. The structure that would normally introduce errors is transformed into a mechanism that prevents error accumulation. The same computational operations that would normally cause problems are redirected through the E matrix, turning a harmful process into a beneficial one that ensures solution correctness.

Inventive Principle:
Principle #22Blessing in disguise (Convert harm into benefit)

Data Source

PatentUS8407172B1Method, apparatus, and article of manufacture for performing a pivot-in-place operation for a linear programming problem
Publication Date: 2013.03.26 SIMPLEROSE INC
  • US8407172B1 patent drawing
  • US8407172B1 patent drawing
  • US8407172B1 patent drawing

AI summary

In accordance with one embodiment, a method of processing a linear programming problem can be implemented by utilizing a unique operation known as a pivot-in-place operation to reduce computer error.