scientific article; zbMATH DE number 3308846

zbMath0194.20201MaRDI QIDQ5589748

Publication date: 1969

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (only showing first 100 items - show all)

An \(\eta\)-approximation approach to duality in mathematical programming problems involving \(r\)-invex functions ⋮ Some nondifferentiable multiobjective programming problems ⋮ A bilevel programming approach to double optimal stopping ⋮ Optimality and duality for nonsmooth multiobjective programming using G-type I functions ⋮ Nonsmooth multiple-objective optimization in separable Hilbert spaces ⋮ On global minima of semistrictly quasiconcave functions ⋮ Second order duality for multiobjective programming with cone constraints ⋮ Exact penalty results for mathematical programs with vanishing constraints ⋮ Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems ⋮ Optimal contract design in the joint economic lot size problem with multi-dimensional asymmetric information ⋮ Generalized quasi-variational inequalities: duality under perturbations ⋮ Quadratic scalarization for decomposed multiobjective optimization ⋮ On duality for mathematical programs with vanishing constraints ⋮ Sufficient optimality conditions and duality theory for interval optimization problem ⋮ Continuous-time optimization problems involving invex functions ⋮ Parameter estimation in metabolic flux balance models for batch fermentation -- formulation and solution using differential variational inequalities (DVIs) ⋮ Farkas-type results for max-functions and applications ⋮ Absolute value equations ⋮ Universal duality in conic convex optimization ⋮ Least-norm linear programming solution as an unconstrained minimization problem ⋮ A gradient-related algorithm with inexact line searches ⋮ Stability on multiobjective dynamic programming problems with fuzzy parameters in the objective functions and in the constraints ⋮ Sensitivity analysis for product design selection with an implicit value function ⋮ Nonsmooth multiobjective programming: strong Kuhn-Tucker conditions ⋮ Semistrict \(G\)-preinvexity and optimality in nonlinear programming ⋮ New optimality conditions and duality results of \(G\) type in differentiable mathematical programming ⋮ Multiple objective linear programming models with interval coefficients -- an illustrated overview ⋮ Duality for multiobjective fractional programming problem using convexifactors ⋮ A class of volumetric barrier decomposition algorithms for stochastic quadratic programming ⋮ A single-shot game of multi-period inspection ⋮ Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency ⋮ Quantile regression with an epsilon-insensitive loss in a reproducing kernel Hilbert space ⋮ Knowledge based least squares twin support vector machines ⋮ Likelihood relations and stochastic preferences ⋮ Second and higher order duality in Banach space under \(\rho-(\eta,\theta)\)-invexity ⋮ Optimal coalition formation and surplus distribution: two sides of one coin ⋮ Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials ⋮ Nondifferentiable higher order duality in multiobjective programming involving cones ⋮ A scalarization proximal point method for quasiconvex multiobjective minimization ⋮ A characterization of the 2-additive Choquet integral through cardinal information ⋮ The use of grossone in mathematical programming and operations research ⋮ Matrix criteria for the pseudo-P-convexity of a quadratic form ⋮ Efficiency and proper efficiency in nonlinear vector maximum problems ⋮ A conjugate gradient algorithm for sparse linear inequalities ⋮ Optimal values and strategies for a particular case of two-person games ⋮ Constructing the set of efficient objective values in multiple objective linear programs ⋮ A reduced support vector machine approach for interval regression analysis ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Minimax approximations to theoretical models using experimental data ⋮ Penalty function methods and a duality gap for invex optimization problems ⋮ Weak efficiency in multiobjective variational problems under generalized convexity ⋮ Optimality and duality for a nonsmooth multiobjective optimization involving generalized type I functions ⋮ On the functions with pseudoconvex sublevel sets and optimality conditions ⋮ Mixed type duality in multiobjective fractional programming under generalized \(\rho\)-univex function ⋮ Regularization and normal solutions of systems of linear equations and inequalities ⋮ Irreducible infeasible sets in convex mixed-integer programs ⋮ Regularized least squares support vector regression for the simultaneous learning of a function and its derivatives ⋮ Generalization of the geometric mean functional relationship ⋮ Second order multiobjective mixed symmetric duality containing square root term with generalized invex function ⋮ Variational analysis on local sharp minima via exact penalization ⋮ Possible and necessary efficiency in possibilistic multiobjective linear programming problems and possible efficiency test ⋮ The principle of extrapolation and the Cayley transform ⋮ Global efficiency for multiobjective bilevel programming problems under generalized invexity ⋮ On an \(l_1\) exact penalty result for mathematical programs with vanishing constraints ⋮ On algorithms for restricted maximum likelihood estimation ⋮ Third order duality in nonlinear programming problems ⋮ The \(\ell_1\) solution of linear inequalities ⋮ A bundle-filter method for nonsmooth convex constrained optimization ⋮ Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting ⋮ Efficiency and generalized convex duality for nondifferentiable multiobjective programs ⋮ Multiple instance learning via margin maximization ⋮ Second-order Kuhn-Tucker invex constrained problems ⋮ A modified SLP algorithm and its global convergence ⋮ The sagitta method for solving linear programs ⋮ Convergence of the projected gradient method for quasiconvex multiobjective optimization ⋮ A note on invex problems with nonnegative variable ⋮ Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints ⋮ A bilinear algorithm for optimizing a linear function over the efficient set of a multiple objective linear programming problem ⋮ The steepest descent gravitational method for linear programming ⋮ Integrating reference point, Kuhn-Tucker conditions and neural network approach for multi-objective and multi-level programming problems ⋮ Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints ⋮ A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions ⋮ Sufficiency criteria and duality for nonlinear programs involving n-set functions ⋮ Potential solutions of linear systems: the multi-criteria multiple constraint levels program ⋮ Optimal constrained selection of a measurable subset ⋮ Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints ⋮ Generalization of convex and related functions ⋮ On-line identification of distributed parameter systems ⋮ Real and complex Fritz John theorems ⋮ Optimality criteria in nonlinear programming involving nonconvex functions ⋮ Two-person pairwise solvable games ⋮ New efficiency conditions for multiobjective interval-valued programming problems ⋮ Conjugate cone characterization of positive definite and semidefinite matrices ⋮ Inexact linear programming with generalized technological matrix sets ⋮ Best approximation and optimization ⋮ Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications ⋮ A characterisation of the feasible set of objective function vectors in linear multiple objective problems ⋮ On the transpose of a pseudomonotone matrix and the LCP ⋮ \(r\)-preinvexity and \(r\)-invexity in mathematical programming ⋮ Optimality and mixed duality in multiobjective \(E\)-convex programming

This page was built for publication: