The following pages link to Faiz A. Al-Khayyal (Q1068730):
Displayed 37 items.
- (Q209916) (redirect page) (← links)
- (Q809895) (redirect page) (← links)
- Finite convergence of algorithms for nonlinear programs and variational inequalities (Q809897) (← links)
- Note on solving linear complementarity problems as jointly constrained bilinear programs (Q809900) (← links)
- Optimization of a quadratic function with a circulant matrix (Q853879) (← links)
- (Q918872) (redirect page) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem (Q1068731) (← links)
- Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\) (Q1177232) (← links)
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming (Q1184526) (← links)
- Global optimization of a nonconvex single facility location problem by sequential unconstrained convex minimization (Q1187370) (← links)
- Generalized bilinear programming. I: Models, applications and linear programming relaxation (Q1199512) (← links)
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique (Q1275717) (← links)
- First-order conditions for isolated locally optimal solutions (Q1321329) (← links)
- Difference of convex solution of quadratically constrained optimization problems. (Q1810525) (← links)
- A relaxation method for nonconvex quadratically constrained quadratic programs (Q1892602) (← links)
- A d.c. optimization method for single facility location problems (Q1904649) (← links)
- A piecewise linearization framework for retail shelf space management models (Q1926922) (← links)
- Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk I: applications and model (Q2432886) (← links)
- Accelerating convergence of cutting plane algorithms for disjoint bilinear programming (Q2460141) (← links)
- A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs (Q2502217) (← links)
- Enhanced intersection cutting-plane approach for linear complementarity problems (Q2565006) (← links)
- Global optimization of a quadratic function subject to a bounded mixed integer constraint set (Q2640438) (← links)
- On characterizing linear complementarity problems as linear programs (Q3471881) (← links)
- Jointly Constrained Biconvex Programming (Q3671770) (← links)
- An implicit enumeration procedure for the general linear complementarity problem (Q3762094) (← links)
- (Q3987199) (← links)
- Solution of Structured Geometric Programs in Sample Survey Design (Q4009004) (← links)
- (Q4176276) (← links)
- (Q4323607) (← links)
- A tree-search method for solving a cutting stock assignment problem (Q4497267) (← links)
- On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems (Q4509750) (← links)
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION (Q4548044) (← links)
- Monotonic Optimization: Branch and Cut Methods (Q5421799) (← links)
- (Q5688505) (← links)
- (Q5753757) (← links)
- Solution of a large-scale two-stage decision and scheduling problem using decomposition (Q5946534) (← links)