infeasible

Definitions

  • WordNet 3.6
    • adj infeasible not capable of being carried out or put into practice "refloating the sunken ship proved impracticable because of its fragility","a suggested reform that was unfeasible in the prevailing circumstances"
    • ***
Webster's Revised Unabridged Dictionary
    • a Infeasible Not capable of being done or accomplished; impracticable.
    • ***
Century Dictionary and Cyclopedia
    • infeasible Not feasible; incapable of accomplishment; impracticable.
    • ***
Chambers's Twentieth Century Dictionary
    • adj Infeasible in-fēz′i-bl not feasible: that cannot be done or accomplished
    • ***

Usage

In literature:

The practical difficulties presented by such schemes, their infeasibility, did not trouble him.
"The History of Sir Richard Calmady" by Lucas Malet
The commander also rejects, at this point, courses of action found to be infeasible of accomplishment.
"Sound Military Decision" by U.s. Naval War College
He sought to talk discontentedly of the project, as if he found it infeasible.
"The Story of Old Fort Loudon" by Charles Egbert Craddock
So free was he from illusion that he could not contend against plain infeasibility.
"The Brothers' War" by John Calvin Reed
***

In news:

But skeptics call many of these " biometric " concepts infeasible.
Smaller tax measure infeasible .
Infeasible and Not Cost Effective.
The $300-per-pound price is still five times costlier than traditional mining, and a Department of Energy-funded analysis found that to be infeasible in the current economy.
Officials rejected the idea of reintroducing wolves to prey on the elk and control their numbers, saying it was infeasible.
***

In science:

The first experiment we run is in the computationally infeasible situation where we do not use the Johnson-Lindenstrauss pro jection, but simply choose the best row out of the randomly selected n rows.
Acceleration of Randomized Kaczmarz Method via the Johnson-Lindenstrauss Lemma
All methods share a preprocessing step to determining feasibility or infeasibility.
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
The preprocessing then determines a solution or infeasibility for each SCC individually using constraint propagation and a destructive lower bound computation.
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
Once a solution for all SCCs is determined a first solution can be deterministically generated for the original instance; otherwise infeasibility is proven.
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
Because the problems are more difficult than pure RCPSP we need to modify our approach in particular to prove feasibility/infeasibility We show that the approach to solving Rcpsp/max performs better than published methods so far, especially for improving a solution, once a solution is found, and proving optimality.
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
In the first phase a Hot Start search was run to determine a first solution or to prove the infeasibility of the instance.
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
The first phase was run until a solution (with makespan U B ) was found or infeasibility proved or the time limit reached.
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
In the first phase the the search strategy used should be at both finding feasible solutions and proving infeasibility.
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
The percentage of instances for which the infeasibility was proven.
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
The number of instances which were proven to be infeasible or optimal.
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
While B&BD00 can prove feasibility and infeasibility of all instances, the first-phase Hot Start search with one second was unable to prove infeasibilty of four infeasible instances or find solutions to two feasible instances.
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
It does prove infeasibility of these four infeasible instances in less than 2.1 seconds and finds a first solution for these two feasible instances in 4.8 seconds and 5.04 seconds respectively.
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
In order to overcome these problems one could run at first e.g. B&BD00 to prove infeasibility and generate a first solution, and then apply our methods.
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
Their methods were able to prove the feasibility or infeasibility for all instances (except one instance for the method FbsF01 ).
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
Within the given time limit Hot Start was not able to find a solution for the instances 2, 4, and 70 and to prove the infeasibility for the instance 40.
Solving the Resource Constrained Project Scheduling Problem with Generalized Precedences by Lazy Clause Generation
***