Conventional quantum algorithms are not feasible for solving combinatorial optimization problems (COPs) with constraints in the operation time of quantum computers. To address this issue ...

Strategy for Exploring Feasible and Infeasible Solution Spaces to Solve a Multiple-Vehicle Bike Sharing System Routing Problem. Applied Sciences, 2021; 11 (16): 7749 DOI: 10.3390/app11167749 ...

Vogel's Approximation Method (VAM) is one of the methods to find Initial Basic Feasible Solution (IBFS) of Transportation Problem (TP), which is mostly used to find the solution with minimum cost.

Active Set Methods The parameter vector can be subject to a set of m linear equality and inequality constraints: The coefficients aij and right-hand sides bi of the equality and inequality constraints ...

So for the XYZ problem, the initial basic feasible solution is (0,0,4,12,18). This gives us an objective function of zero, which is not very optimal, but at least it's a start.