نتایج جستجو برای: initial basic feasible solution
تعداد نتایج: 1117436 فیلتر نتایج به سال:
In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
The supply, demand and transportation cost in problem cannot be obtained by all existing methods directly. In the literature, various have been proposed for calculating cost. this paper, we are comparing measuring optimal objective of paper is obtaining IBFS real-life problems methods. include such as AMM (Arithmetic Mean Method), ASM (Assigning Shortest Minimax Method) etc. Initial Basic Feasi...
The fuzzy linear second order equations with fuzzy initial values are investigatedin this paper. The analytic general solution solutions of them usinga rst solution is founded. The parametric form of fuzzy numbers is appliedto solve the second order equations. General solutions for fuzzy linear secondorder equations with fuzzy initial values are investigated and formulatedin four cases. A examp...
چکیده ندارد.
We consider interval linear programming (ILP) problems in the current paper. Best-worst case (BWC) is one of the methods for solving ILP models. BWC determines the values of the target function, but some of the solutions obtained through BWC may result in an infeasible space. To guarantee that solution is completely feasible (i.e. avoid constraints violation), improved two-step method (ITSM) ...
Habibollah Haron Department of Computer Science, Faculty of Computing (FC), UniversitiTeknologi Malaysia, Malaysia Emai: [email protected] Abstract: The course timetabling problem is not a trivial task as it is an NP-hard and NP-complete problem and many solutions have been proposed due to its high complexity search landscape. In essence, the nature of the course timetabling problem is to assign a l...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید