The following pages link to (Q5589748):
Displaying 50 items.
- Optimality conditions in nondifferentiable \(G\)-invex multiobjective programming (Q978416) (← links)
- A characterization of pseudoinvexity for the efficiency in non-differentiable multiobjective problems. Duality (Q984082) (← links)
- Mesh shape-quality optimization using the inverse mean-ratio metric (Q985312) (← links)
- Generalized convexity and efficiency for non-regular multiobjective programming problems with inequality-type constraints (Q988139) (← links)
- Weakly efficient solutions and pseudoinvexity in multiobjective control problems (Q988827) (← links)
- Convergence of a projected gradient method variant for quasiconvex objectives (Q992826) (← links)
- Geometric conditions for Kuhn-Tucker sufficiency of global optimality in mathematical programming (Q1002048) (← links)
- \(d-\rho -(\eta ,\theta )\)-invexity in multiobjective optimization (Q1004626) (← links)
- Nonlinear programming with \(E\)-preinvex and local \(E\)-preinvex functions (Q1011216) (← links)
- Generalized convexity in non-regular programming problems with inequality-type constraints (Q1018658) (← links)
- Optimality conditions for an isolated minimum of order two in \(C1\) constrained optimization (Q1022996) (← links)
- Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724) (← links)
- Use of stochastic and mathematical programming in portfolio theory and practice (Q1026547) (← links)
- Exact penalty functions method for mathematical programming problems involving invex functions (Q1027576) (← links)
- Necessary and sufficient conditions for Kuhn-Tucker type optimality and for weak duality of nonsmooth programming (Q1029440) (← links)
- On \(G\)-invex multiobjective programming. I: Optimality (Q1029669) (← links)
- Optimality conditions for vector optimization problems (Q1035917) (← links)
- Necessary optimality conditions for a class of nonsmooth vector optimization (Q1036898) (← links)
- A necessary and sufficient condition for duality in multiobjective variational problems (Q1038320) (← links)
- Nondifferentiable multiobjective programming under generalized \(d_I\)-invexity (Q1038374) (← links)
- A general equilibrium analysis of the Laffer argument (Q1039567) (← links)
- Learning the optimal kernel for Fisher discriminant analysis via second order cone programming (Q1046076) (← links)
- On the characterization of noninferior solutions of the vector optimization problem (Q1050907) (← links)
- Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs (Q1058992) (← links)
- Dualizing optimization problems in mathematical economics (Q1060135) (← links)
- Convergence results for an accelerated nonlinear Cimmino algorithm (Q1061456) (← links)
- The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\) (Q1061967) (← links)
- Sensitivity analysis of an agricultural linear programming model (Q1062624) (← links)
- Three dimensional line stochastic matrices and extreme points (Q1063663) (← links)
- Some existence and regularity results for dual linear control problems (Q1065346) (← links)
- The optimality of balancing workloads in certain types of flexible manufacturing systems (Q1066800) (← links)
- Sufficient optimality conditions in continuous-time nonlinear programming (Q1067197) (← links)
- On the problem of weights in multiple criteria decision making (the noncompensatory approach) (Q1067990) (← links)
- Two general methods for computing saddle points with applications for decomposing convex programming problems (Q1069674) (← links)
- An incremental and parametrical algorithm for convex-concave fractional programming with a single constraint (Q1069860) (← links)
- A continuous-time generalization of Gordan's transposition theorem (Q1072454) (← links)
- Optimality conditions in multiobjective differentiable programming (Q1076613) (← links)
- On the sufficiency of the linear maximum principle for discrete-time control problems (Q1078510) (← links)
- The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming (Q1083380) (← links)
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming (Q1085068) (← links)
- A numerical scheme for integrating the rate plasticity equations with an ''a priori'' error control (Q1087362) (← links)
- A note on best constants in discrete inequalities (Q1087472) (← links)
- Analysis of the objective space in multiple objective linear programming (Q1095043) (← links)
- Multiobjective duality with invexity (Q1097841) (← links)
- A characterization of lower semicontinuity of constraint sets (Q1100096) (← links)
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems (Q1101679) (← links)
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs (Q1103527) (← links)
- Projectively-convex sets and functions (Q1106063) (← links)
- A simple characterization of solutions sets of convex programs (Q1108196) (← links)
- Characterizing optimality in mathematical programming models (Q1108200) (← links)
