The following pages link to Tibor Illés (Q317430):
Displaying 17 items.
- (Q180481) (redirect page) (← links)
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
- Optimality criteria for general unconstrained geometric programming problems (Q811403) (← links)
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation (Q828652) (← links)
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems (Q877592) (← links)
- A polynomial path-following interior point algorithm for general linear complementarity problems (Q989885) (← links)
- EP theorem for dual linear complementarity problems (Q1016385) (← links)
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming (Q1291813) (← links)
- Pseudoconvex optimization for a special problem of paint industry (Q1342653) (← links)
- Optimization of nuclear reactor reloading patterns (Q1357771) (← links)
- Entropy and Young programs: Relations and self-concordance. (Q1412115) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied (Q1787922) (← links)
- The finite criss-cross method for hyperbolic programming (Q1809838) (← links)
- The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems (Q5167105) (← links)
- EUR\(O\)pt, the continuous optimization working group of EURO: from idea to maturity (Q6114937) (← links)
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation (Q6491339) (← links)
