Research article · Apr 2014
Research articlePublished Jan 2014
A PROCEDURE FOR SOLVING INTEGER BILEVEL LINEAR PROGRAMMING PROBLEMS
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
This paper is an extension of the K th-best approach [4] for solving bilevel linear programming problems with integer variables. NAZ cut [2] and A-T cut [3] are added to reach the integer optimum. An example is given to show the efficiency of the proposed algorithm.
Subjects
EngineeringAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · Jun 2014
INTUITIONISTIC FUZZY MULTIOBJECTIVE NON LINEAR PROGRAMMING PROBLEM (IFMONLPP) USING TAYLOR SERIES APPROACH
Research article · 2012
An Improved Direct Search Approach for Solving Mixed-Integer Nonlinear Programming Problems
Research article · 2015
Sequential Lifting of General Integer Variables for Integer Programs
Research article · May 2014
Optimal Scheduling Techniques for Charging the Batteries of Electric Vehicles under Time-Of-Use Pricing Using Binary Integer Programming
More from this journal
The newest in International Journal of Innovative Research in Science, Engineering and Technology.
Review article · 2018
Tech-Care: Personal Health Monitoring and Prediction System
Research article · 2018
Spectrum Sensing Methods for Cognitive Radio: A Survey
Review article · 2018
Utilization of Food Wastes to Prepare Film Forming Biomolecules (Retracted)
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalInternational Journal of Innovative Research in Science, Engineering and Technology
- SubjectEngineering
- BylineArticles whose byline prints “A.Y. Adhami”
- BylineArticles whose byline prints “Quazzafi Rabbani”
