2010•Sichuan University of Arts and Science JournalRequires access

A Note of Artificial Constrained Method Searching for Dual Feasible Solution

Chen Wen

Abstract

When directly obtaining no feasible solution to the dual problem with the dual simplex method for solving linear programming problems,the artificial constraint method can be introduced to find an initial feasible solution to the dual problem.The relationship between the solutions of the original problem(LP) and the new planning(LPM) is discussed and the proofs are given in the paper.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Dual (grammatical number), Simplex algorithm, Mathematical optimization, Linear programming, Constraint (computer-aided design), Simplex, Mathematical proof, Constraint satisfaction dual problem