Pages that link to "Item:Q2534839"
From MaRDI portal
The following pages link to Proper efficiency and the theory of vector maximization (Q2534839):
Displaying 50 items.
- Optimality and duality results for a nondifferentiable multiobjective fractional programming problem (Q264348) (← links)
- Strongly proper efficient solutions: efficient solutions with bounded trade-offs (Q283930) (← links)
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- A combined scalarizing method for multiobjective programming problems (Q299884) (← links)
- Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem (Q312682) (← links)
- A remark on multiobjective stochastic optimization via strongly convex functions (Q314598) (← links)
- An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization (Q315505) (← links)
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- Heuristic approaches for biobjective mixed 0-1 integer linear programming problems (Q319659) (← links)
- Robustness in nonsmooth nonlinear multi-objective programming (Q319993) (← links)
- Constraint qualifications in convex vector semi-infinite optimization (Q320868) (← links)
- Inverse DEA with frontier changes for new product target setting (Q323375) (← links)
- Approximate representation of the Pareto frontier in multiparty negotiations: decentralized methods and privacy preservation (Q323444) (← links)
- On the convergence of adaptive stochastic search methods for constrained and multi-objective black-box optimization (Q328457) (← links)
- Quadratic scalarization for decomposed multiobjective optimization (Q331788) (← links)
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612) (← links)
- An exact algorithm for biobjective mixed integer linear programming problems (Q342401) (← links)
- Semilocal \(E\)-preinvexity and its applications in nonlinear multiple objective fractional programming (Q366020) (← links)
- Strict efficiency in vector optimization with nearly convexlike set-valued maps (Q370046) (← links)
- The weighted sum method for multi-objective optimization: new insights (Q381490) (← links)
- Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency (Q395599) (← links)
- On the efficiency of price competition (Q408424) (← links)
- On approximating weakly/properly efficient solutions in multi-objective programming (Q410073) (← links)
- Optimality theorems for convex semidefinite vector optimization problems (Q425863) (← links)
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
- Super efficiency of multicriterion network equilibrium model and vector variational inequality (Q430943) (← links)
- \(L\)-invex-infine functions and applications (Q435079) (← links)
- Multi-choice goal programming formulation based on the conic scalarizing function (Q437838) (← links)
- Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions (Q458969) (← links)
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets (Q467443) (← links)
- Isolated and proper efficiencies in semi-infinite vector optimization problems (Q467444) (← links)
- Enhanced efficiency in multi-objective optimization (Q467454) (← links)
- Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces (Q467463) (← links)
- Wolfe type second order nondifferentiable symmetric duality in multiobjective programming over cone with generalized \((K, F)\)-convexity (Q469950) (← links)
- Derivatives of set-valued maps and gap functions for vector equilibrium problems (Q475355) (← links)
- Properly optimal elements in vector optimization with variable ordering structures (Q475805) (← links)
- Mixed type duality in multiobjective fractional programming under generalized \(\rho\)-univex function (Q483219) (← links)
- Proper efficiency and proper Karush-Kuhn-Tucker conditions for smooth multiobjective optimization problems (Q484487) (← links)
- Global efficiency for multiobjective bilevel programming problems under generalized invexity (Q513525) (← links)
- An equivalent transformation of multi-objective optimization problems (Q513605) (← links)
- On Benson's scalarization in multiobjective optimization (Q518145) (← links)
- On the Fritz John saddle point problem for differentiable multiobjective optimization (Q522444) (← links)
- An approximation algorithm for convex multi-objective programming problems (Q548180) (← links)
- Constructing efficient solutions structure of multiobjective linear programming (Q557002) (← links)
- Generalized type I invexity and duality in multiobjective variational problems (Q557005) (← links)
- Value functions, domination cones and proper efficiency in multicriteria optimization (Q583121) (← links)
- Stochastic versus possibilistic programming (Q584073) (← links)
- Multiobjective management of mining under water hazard by game theory (Q595510) (← links)
- Tightly proper efficiency in vector optimization with nearly cone-subconvexlike set-valued maps (Q623651) (← links)
- Nondifferentiable multiobjective second-order symmetric duality (Q628658) (← links)