scientific article
From MaRDI portal
Publication:3141920
zbMath0799.90080MaRDI QIDQ3141920
Shu-Cherng Fang, Sarat Puthenpura
Publication date: 2 November 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (58)
Sums of idempotents and logarithmic residues in zero pattern matrix algebras ⋮ Associative memories based on continuous-time cellular neural networks designed using space-invariant cloning templates ⋮ A neural network model with bounded-weights for pattern classification ⋮ A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming ⋮ Solving linear optimization problems with max-star composition equation constraints ⋮ Solving a linear programming problem with the convex combination of the max-min and the Max-average fuzzy relation equations ⋮ On the entropic regularization method for solving min-max problems with applications ⋮ A multiobjective evolutionary approach for linearly constrained project selection under uncertainty ⋮ Perturbing the dual feasible region for solving convex quadratic programs ⋮ Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming ⋮ Linear programming with stochastic elements: An on-line approach ⋮ Multiperiod mean semi-absolute deviation interval portfolio selection with entropy constraints ⋮ A compressed primal-dual method for generating bivariate cubic \(L_{1}\) splines ⋮ A relaxed primal-dual path-following algorithm for linear programming ⋮ An infeasible-start path-following method for monotone LCPs ⋮ An adaptation of the dual-affine interior point method for the surface flatness problem ⋮ Solving convex programming problems with equality constaints by neural networks ⋮ A dual projective simplex method for linear programming ⋮ Solving stochastic programming problems via Kalman filter and affine scaling ⋮ Soft Quadratic Surface Support Vector Machine for Binary Classification ⋮ An unconstrained dual approach to solving Karmarkar-type linear programs using conventional barrier functions ⋮ Fuzzy data envelopment analysis (DEA): A possibility approach ⋮ Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis ⋮ Linear programming with fuzzy coefficients in constraints ⋮ Improved linear programming methods for checking avoiding sure loss ⋮ Relaxed cutting plane method for solving linear semi-infinite programming problems ⋮ Active set strategies in an ellipsoid algorithm for nonlinear programming ⋮ Improving and benchmarking of algorithms for \(\Gamma \)-maximin, \( \Gamma \)-maximax and interval dominance ⋮ Higher-order multivariate Markov chains and their applications ⋮ Solving linear optimization problem with fuzzy relational equations as constraints. ⋮ An ellipsoid algorithm for equality-constrained nonlinear programs ⋮ Evaluating betting odds and free coupons using desirability ⋮ An inexact approach to solving linear semi-infinite programming problems ⋮ Resolution of fuzzy regression model ⋮ Geometric dual formulation for first-derivative-based univariate cubic \(L_{1}\) splines ⋮ Optimization of fuzzy relation equations with max-product composition. ⋮ A geometric programming approach for bivariate cubic \(L_{1}\) splines ⋮ Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme ⋮ Linear objective function optimization with fuzzy relation equation constraints regarding max--av composition ⋮ Discretization method for semi-definite programming ⋮ A geometric programming framework for univariate cubic \(L_1\) smoothing splines ⋮ A new ranking method to fuzzy data envelopment analysis ⋮ On optimizing a linear objective function subjected to fuzzy relation inequalities ⋮ Rank decomposition under zero pattern constraints and \(\mathsf{L}\)-free directed graphs ⋮ On the sparseness of 1-norm support vector machines ⋮ An efficient search direction for linear programming problems ⋮ An algorithm for optimizing the linear function with fuzzy relation equation constraints regarding max-prod composition ⋮ A basis-defiency-allowing variation of the simplex method for linear programming ⋮ Improving and benchmarking of algorithms for decision making with lower previsions ⋮ Constrained unidimensional scaling with application to genomics ⋮ Solving min-max problems and linear semi-infinite programs ⋮ High resolution pursuit for feature extraction ⋮ An interval-valued fuzzy linear programming with infinite \(\alpha\)-cuts method for environmental management under uncertainty ⋮ Optimizing MSE for clustering with balanced size constraints ⋮ Solving fuzzy relation equations with a linear objective function ⋮ An efficient and flexible mechanism for constructing membership functions ⋮ An \(\varepsilon\)-sensitivity analysis in the primal-dual interior point method ⋮ Entropic perturbation method for solving a system of linear inequalities
This page was built for publication:
