zbMath0679.90029MaRDI QIDQ1187662
Mordecai Avriel, Israel Zang, Siegfried Schaible, W. Erwin Diewert
Publication date: 17 September 1992
Published in: Mathematical Concepts and Methods in Science and Engineering (Search for Journal in Brave)
On the existence theorems of solutions for generalized vector variational inequalities,
Generalized monotonicity and convexity of non-differentiable functions,
Characterizations of nonconvex optimization problems via variational inequalities,
A hybrid LP/NLP paradigm for global optimization relaxations,
Efficiency estimation and duality theory for nonconvex technologies,
Parametric linear fractional programming for an unbounded feasible region,
Abstract concavity of increasing co-radiant and quasi-concave functions with applications in mathematical economics,
Sectionwise connected sets in vector optimization,
Inexact subgradient methods for quasi-convex optimization problems,
Convergence of inexact quasisubgradient methods with extrapolation,
Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces,
Inter-temporal price discrimination and satiety-driven repeat purchases,
Parametric nonlinear discrete optimization over well-described sets and matroid intersections,
Some Equivalences Among Nonlinear Complementarity Problems, Least-Element Problems, and Variational Inequality Problems in Ordered Spaces,
On the Hessian matrix and Minkowski addition of quasiconvex functions,
Computational aspects of prospect theory with asset pricing applications,
A deterministic inventory/production model with general inventory cost rate function and piecewise linear concave production costs,
On the equivalence of nonlinear complementarity problems and least-element problems,
Global minimization of the difference of increasing co-radiant and quasi-concave functions,
An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming,
Efficient algorithms for solving nonlinear fractional programming problems,
On inferior inputs and marginal returns,
Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds,
On minquantile and maxcovering optimisation,
Using duality to solve generalized fractional programming problems,
Pseudolinear fuzzy mappings,
Characterizations of the solution set for non-essentially quasiconvex programming,
Some remarks on Greenberg-Pierskalla subdifferentiability of quasiconvex functions,
Optimising portfolio diversification and dimensionality,
A new linearization method for generalized linear multiplicative programming,
The supermodularity of the tax competition game,
Pseudoconvexity on a closed convex set: an application to a wide class of generalized fractional functions,
An efficient algorithm for globally solving generalized linear multiplicative programming,
Fuzzy convexity and multiobjective convex optimization problems,
Improved algorithms for several network location problems with equality measures.,
The joint replenishment problem with variable production costs,
Quasi M-convex and L-convex functions -- quasiconvexity in discrete optimization,
Characterizations of pseudoconvex functions and semistrictly quasiconvex ones,
Multivariate decision-making under risk aversion,
A mean value theorem for tangentially convex functions,
Solving linear fractional bilevel programs.,
Global solution of optimization problems with signomial parts,
The origins of quasi-concavity: a development between mathematics and economics.,
Relaxations of factorable functions with convex-transformable intermediates,
Duality theorems for convex and quasiconvex set functions,
Sandwich theorem for reciprocally strongly convex functions,
Second-order characterizations of quasiconvexity and pseudoconvexity for differentiable functions with Lipschitzian derivatives,
Minimizing the Difference of Dual Functions of Two Coradiant Functions,
A sequential method for a class of pseudoconcave fractional problems,
Convex underestimation for posynomial functions of positive variables,
Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods,
Global optimization of fractional programs,
Reduction of indefinite quadratic programs to bilinear programs,
Invariant domain preserving discretization-independent schemes and convex limiting for hyperbolic systems,
Computing the level set convex hull,
Some remarks on the class of continuous (semi-)strictly quasiconvex functions,
A note on Ramsey pricing and the structure of preferences,
Duality theorems for quasiconvex programming with a reverse quasiconvex constraint,
Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization, Lower subdifferentiability of quadratic functions, Global optimization of nonconvex problems with convex-transformable intermediates, A characterization of level-continuous fuzzy numbers, Variational-like inequalities with relaxed \(\eta -\alpha\) pseudomonotone mappings in Banach spaces, Optimal static pricing for a tree network, Aggregation functions and generalized convexity in fuzzy optimization and decision making, Pareto-optimality of compromise decisions, Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions, A note on fuzzy convexity., Convexity and upper semicontinuity of fuzzy sets, A note on invex problems with nonnegative variable, Fractional programming with convex quadratic forms and functions, Global minimization of the difference of strictly non-positive valued affine ICR functions, Workload reduction of a generalized Brownian network, The Tikhonov regularization for equilibrium problems and applications to quasi-hemivariational inequalities, On generalized linearity of quadratic fractional functions, Equilibrium problems under generalized convexity and generalized monotonicity, Karush-Kuhn-Tucker type optimality condition for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential, Quadratic programming and combinatorial minimum weight product problems, Optimality conditions and constraint qualifications for quasiconvex programming, Pricing for QoS Provisioning Across Multiple Internet Service Provider Domains, A global optimization approach for generating efficient points for multiobjective concave fractional programs, On the convexity of functional splines, Characterization of radially lower semicontinuous pseudoconvex functions, Resource allocation to defensive marketing and manufacturing strategies, Convexity and semicontinuity of fuzzy sets, Quasi-convex feasibility problems: subgradient methods and convergence rates, A converse of the Gale-Klee-Rockafellar theorem: Continuity of convex functions at the boundary of their domains, Convergence rates of subgradient methods for quasi-convex optimization problems, Duality for the level sum of quasiconvex functions and applications, Johri's general dual, the Lagrangian dual, and the surrogate dual, Equilibrium constrained optimization problems, Global optimization for the sum of concave-convex ratios problem, On the subdifferentials of quasiconvex and pseudoconvex functions and cyclic monotonicity, On the convexification of nonlinear programming problems: An applications-oriented survey, Unnamed Item, Locating a median line with partial coverage distance, Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential, Piecewise-linear LQ control for systems with input constraints, Generalized invex monotonicity, An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems, Optimal Routing in Closed Queueing Networks with State Dependent Queues, Dinkelbach Type Approximation Algorithms for Nonlinear Fractional Optimization Problems, Quasiconvex relaxations based on interval arithmetic, A quasi-concave DEA model with an application for bank branch performance evaluation, Transconcave data envelopment analysis, A fractional model for locating semi-desirable facilities on networks, Global optimization of nonlinear sums of ratios, Duality for nonsmooth mathematical programming problems with equilibrium constraints, Abstract convergence theorem for quasi-convex optimization problems with applications, Characterizations of strictly convex sets by the uniqueness of support points, Unnamed Item