The following pages link to Syuuji Yamada (Q208959):
Displaying 31 items.
- (Q161410) (redirect page) (← links)
- Improvements by analyzing the efficient frontier in DEA (Q439350) (← links)
- (Q585676) (redirect page) (← links)
- Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation (Q631850) (← links)
- Relationships between vector-valued cone-dc and locally cone-dc functions (Q695112) (← links)
- An inner approximation method incorporating with a penalty function method for a reverse convex programming problem (Q697546) (← links)
- An outer approximation algorithm guaranteeing feasibility of solutions and approximate accuracy of optimality (Q1304754) (← links)
- An inner approximation method for optimization over the weakly efficient set (Q1580428) (← links)
- An inner approximation method using a descent method for a reverse convex programming problem (Q2740700) (← links)
- Improvements for an inner approximation method for reverse convex programming problems (Q2742685) (← links)
- An inner approximation method for optimization over the weakly efficient set (Q2753338) (← links)
- Expansion of the cross-efficiency evaluation by using the equations forming the efficient frontier in DEA (Q2867414) (← links)
- (Q3004785) (← links)
- (Q3004786) (← links)
- (Q3007178) (← links)
- (Q3007196) (← links)
- (Q3066883) (← links)
- (Q3104296) (← links)
- (Q3116779) (← links)
- (Q3517050) (← links)
- (Q4514778) (← links)
- (Q4581808) (← links)
- (Q4581828) (← links)
- (Q4592968) (← links)
- (Q4703164) (← links)
- (Q4705049) (← links)
- (Q4761959) (← links)
- (Q5177799) (← links)
- Successive search methods for solving a canonical DC programming problem (Q5413891) (← links)
- Inner approximation method for a reverse convex programming problem (Q5925727) (← links)
- An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set (Q5946143) (← links)
