Cart (Loading....) | Create Account
Close category search window

An artificial variable RZ decision method for geometric superfluity of condition constraint in linear programming problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

In this paper, based on the rotary iteration transformation in the simplex method, an artificial variable return-to-zero (RZ) algorithm is proposed to decide whether some condition constraint in linear programming problem is geometrically superfluous or not, as turns the decision problem of condition constraint geometric superfluity into such one whether condition constraint set of equations in its normalized form has such feasible basis solution in which every component corresponding to artificial variable is nought. Moreover, with the help of this method above, a feasible way to simplify linear programming problem is obtained.

Published in:

Intelligent Systems and Knowledge Engineering (ISKE), 2010 International Conference on

Date of Conference:

15-16 Nov. 2010

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.