• Home
  • Browse
    • Current Issue
    • By Issue
    • By Author
    • By Subject
    • Author Index
    • Keyword Index
  • Journal Info
    • About Journal
    • Aims and Scope
    • Editorial Board
    • Editorial Staff
    • Publication Ethics
    • Indexing and Abstracting
    • Related Links
    • FAQ
    • Peer Review Process
    • News
  • Guide for Authors
  • Submit Manuscript
  • Reviewers
  • Contact Us
 
  • Login ▼
    • Login
    • Register
  • Persian
Home Articles List Article Information
  • Save Records
  • |
  • Printable Version
  • |
  • Recommend
  • |
  • How to cite Export to
    RIS EndNote BibTeX APA MLA Harvard Vancouver
  • |
  • Share Share
    CiteULike Mendeley Facebook Google LinkedIn Twitter Telegram
Iranian Journal of Optimization
Articles in Press
Current Issue
Journal Archive
Volume Volume 09 (2017)
Volume Volume 08 (2016)
Volume Volume 07 (2015)
Volume Volume 06 (2014)
Volume Volume 05 (2013)
Volume Volume 04 (2012)
Issue Issue 2
Issue Issue 1
Volume Volume 03 (2011)
Volume Volume 02 (2010)
Volume Volume 01 (2009)
Sashi Bhusan, D., Bagaban, B., Tripathy, J. (2010). Some Results on facets for linear inequality in 0-1 variables. Iranian Journal of Optimization, 04(1), 334-349.
D. Sashi Bhusan; B. Bagaban; J.P. Tripathy. "Some Results on facets for linear inequality in 0-1 variables". Iranian Journal of Optimization, 04, 1, 2010, 334-349.
Sashi Bhusan, D., Bagaban, B., Tripathy, J. (2010). 'Some Results on facets for linear inequality in 0-1 variables', Iranian Journal of Optimization, 04(1), pp. 334-349.
Sashi Bhusan, D., Bagaban, B., Tripathy, J. Some Results on facets for linear inequality in 0-1 variables. Iranian Journal of Optimization, 2010; 04(1): 334-349.

Some Results on facets for linear inequality in 0-1 variables

Article 3, Volume 04, Issue 1, Winter 2012, Page 334-349  XML PDF (128 K)
Document Type: Research Paper
Authors
D. Sashi Bhusan1; B. Bagaban2; J.P. Tripathy 3
1Department of Mathematics, Balasore College of Engg . & Technology Teach. Sergarh, Balasore , Orissa , India
2Ms.student of Mathematics, F. M. Autonomous College, Balasore, Orissa, India
3Department of Mathematics Gurukul Institute of Technology Bhubaneswar, Orissa, India
Receive Date: 25 August 2010,  Accept Date: 25 August 2010 
Abstract
The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality has been presented in this current paper. Such type of facets plays an important role in set covering set partitioning, matroidal-intersection vertex- packing, generalized assignment and other combinatorial problems. Strong covers for facets of Knapsack ploytope has been developed in the first part of the present paper. Generating family of valid cutting planes that satisfy inequality with 0-1 variables through algorithms are the attraction of this paper.
Main Subjects
Data Envelopment Analysis
Statistics
Article View: 869
PDF Download: 671
Home | Glossary | News | Aims and Scope | Sitemap
Top Top

Free web analytics powered by GoStats.

Journal Management System. Designed by sinaweb.