Pages that link to "Item:Q5935423"
From MaRDI portal
The following pages link to Two direct methods in linear programming (Q5935423):
Displaying 15 items.
- Algebraic simplex initialization combined with the nonfeasible basis method (Q319588) (← links)
- A heuristic algorithm for resource allocation/reallocation problem (Q410767) (← links)
- Artificial-free simplex algorithm based on the non-acute constraint relaxation (Q470802) (← links)
- On simplex method with most-obtuse-angle rule and cosine rule (Q548344) (← links)
- A comparative study of redundant constraints identification methods in linear programming problems (Q624719) (← links)
- Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods (Q709179) (← links)
- A note on ``An improved initial basis for the simplex algorithm'' (Q883303) (← links)
- The complex interior-boundary method for linear and nonlinear programming with linear constraints (Q979276) (← links)
- A note on two direct methods in linear programming (Q1827666) (← links)
- On the simplex algorithm initializing (Q1938217) (← links)
- An improved initial basis for the simplex algorithm (Q2387247) (← links)
- A simple direct cosine simplex algorithm (Q2391301) (← links)
- Global attitude and gyro bias estimation based on set-valued observers (Q2439152) (← links)
- A heuristic approach for identification of redundant constraints in linear programming models (Q3437363) (← links)
- Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints (Q5175471) (← links)